/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:29:20,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:29:20,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:29:20,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:29:20,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:29:20,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:29:20,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:29:20,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:29:20,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:29:20,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:29:20,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:29:20,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:29:20,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:29:20,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:29:20,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:29:20,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:29:20,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:29:20,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:29:20,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:29:20,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:29:20,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:29:20,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:29:20,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:29:20,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:29:20,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:29:20,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:29:20,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:29:20,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:29:20,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:29:20,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:29:20,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:29:20,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:29:20,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:29:20,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:29:20,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:29:20,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:29:20,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:29:20,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:29:20,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:29:20,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:29:20,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:29:20,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:29:20,717 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:29:20,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:29:20,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:29:20,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:29:20,721 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:29:20,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:29:20,721 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:29:20,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:29:20,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:29:20,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:29:20,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:29:20,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:29:20,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:29:20,723 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:29:20,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:29:20,724 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:29:20,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:29:20,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:29:20,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:29:20,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:29:20,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:29:20,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:29:20,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:29:20,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:29:20,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:29:20,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:29:20,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:29:20,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:29:20,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:29:20,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:29:21,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:29:21,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:29:21,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:29:21,070 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:29:21,071 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:29:21,071 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl [2020-02-10 19:29:21,073 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl' [2020-02-10 19:29:21,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:29:21,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:29:21,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:29:21,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:29:21,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:29:21,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:29:21,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:29:21,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:29:21,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:29:21,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... [2020-02-10 19:29:21,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:29:21,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:29:21,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:29:21,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:29:21,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:29:21,252 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:29:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:29:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:29:21,253 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:29:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:29:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:29:21,254 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:29:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:29:21,254 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:29:21,254 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:29:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:29:21,255 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:29:21,255 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:29:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:29:21,255 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:29:21,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 19:29:21,256 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 19:29:21,256 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 19:29:21,256 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:29:21,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:29:21,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:29:21,257 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:29:21,257 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:29:21,257 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:29:21,257 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:29:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:29:21,258 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:29:21,258 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_10 given in one single declaration [2020-02-10 19:29:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure set_10 [2020-02-10 19:29:21,258 INFO L138 BoogieDeclarations]: Found implementation of procedure set_10 [2020-02-10 19:29:21,259 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:29:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:29:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:29:21,259 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 19:29:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 19:29:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 19:29:21,261 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 19:29:21,569 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:29:21,569 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:29:21,573 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:29:21 BoogieIcfgContainer [2020-02-10 19:29:21,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:29:21,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:29:21,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:29:21,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:29:21,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:21" (1/2) ... [2020-02-10 19:29:21,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c92a47d and model type example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:29:21, skipping insertion in model container [2020-02-10 19:29:21,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:29:21" (2/2) ... [2020-02-10 19:29:21,581 INFO L109 eAbstractionObserver]: Analyzing ICFG example_11.bpl [2020-02-10 19:29:21,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:29:21,591 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:29:21,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:29:21,600 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:29:21,892 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-02-10 19:29:21,924 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:29:21,924 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:29:21,925 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:29:21,925 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:29:21,925 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:29:21,926 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:29:21,926 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:29:21,926 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:29:21,948 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 168 transitions [2020-02-10 19:29:21,951 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 19:29:33,253 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 19:29:33,253 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 19:29:33,386 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 19:29:33,613 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 19:29:43,291 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 19:29:43,292 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 19:29:43,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 19:29:43,558 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5060 [2020-02-10 19:29:43,559 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:29:43,861 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1375 [2020-02-10 19:29:43,862 INFO L214 etLargeBlockEncoding]: Total number of compositions: 12 [2020-02-10 19:29:43,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 156 transitions [2020-02-10 19:31:25,150 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 179196 states. [2020-02-10 19:31:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 179196 states. [2020-02-10 19:31:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:31:25,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:25,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:25,877 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1136777304, now seen corresponding path program 1 times [2020-02-10 19:31:25,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719791729] [2020-02-10 19:31:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:26,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719791729] [2020-02-10 19:31:26,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:26,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:31:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974006949] [2020-02-10 19:31:26,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:31:26,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:31:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:31:26,082 INFO L87 Difference]: Start difference. First operand 179196 states. Second operand 3 states. [2020-02-10 19:31:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:31,328 INFO L93 Difference]: Finished difference Result 146172 states and 1021320 transitions. [2020-02-10 19:31:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:31:31,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:31:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:32,470 INFO L225 Difference]: With dead ends: 146172 [2020-02-10 19:31:32,471 INFO L226 Difference]: Without dead ends: 146171 [2020-02-10 19:31:32,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:31:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146171 states. [2020-02-10 19:31:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146171 to 146171. [2020-02-10 19:31:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146171 states. [2020-02-10 19:31:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146171 states to 146171 states and 1021319 transitions. [2020-02-10 19:31:55,844 INFO L78 Accepts]: Start accepts. Automaton has 146171 states and 1021319 transitions. Word has length 34 [2020-02-10 19:31:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:55,846 INFO L479 AbstractCegarLoop]: Abstraction has 146171 states and 1021319 transitions. [2020-02-10 19:31:55,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:31:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 146171 states and 1021319 transitions. [2020-02-10 19:32:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:32:03,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:03,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:03,587 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash -356386054, now seen corresponding path program 1 times [2020-02-10 19:32:03,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:03,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593624634] [2020-02-10 19:32:03,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:03,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593624634] [2020-02-10 19:32:03,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:03,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:32:03,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222173843] [2020-02-10 19:32:03,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:32:03,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:32:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:32:03,648 INFO L87 Difference]: Start difference. First operand 146171 states and 1021319 transitions. Second operand 3 states. [2020-02-10 19:32:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:04,845 INFO L93 Difference]: Finished difference Result 145147 states and 1010567 transitions. [2020-02-10 19:32:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:32:04,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:32:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:06,892 INFO L225 Difference]: With dead ends: 145147 [2020-02-10 19:32:06,892 INFO L226 Difference]: Without dead ends: 145147 [2020-02-10 19:32:06,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:32:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145147 states. [2020-02-10 19:32:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145147 to 145147. [2020-02-10 19:32:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145147 states. [2020-02-10 19:32:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145147 states to 145147 states and 1010567 transitions. [2020-02-10 19:32:25,101 INFO L78 Accepts]: Start accepts. Automaton has 145147 states and 1010567 transitions. Word has length 34 [2020-02-10 19:32:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:25,101 INFO L479 AbstractCegarLoop]: Abstraction has 145147 states and 1010567 transitions. [2020-02-10 19:32:25,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:32:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 145147 states and 1010567 transitions. [2020-02-10 19:32:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:32:33,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:33,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:33,875 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 935006680, now seen corresponding path program 1 times [2020-02-10 19:32:33,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:33,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572184889] [2020-02-10 19:32:33,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:33,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572184889] [2020-02-10 19:32:33,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:33,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:32:33,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479200810] [2020-02-10 19:32:33,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:32:33,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:32:33,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:32:33,917 INFO L87 Difference]: Start difference. First operand 145147 states and 1010567 transitions. Second operand 3 states. [2020-02-10 19:32:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:35,607 INFO L93 Difference]: Finished difference Result 139515 states and 956551 transitions. [2020-02-10 19:32:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:32:35,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:32:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:36,209 INFO L225 Difference]: With dead ends: 139515 [2020-02-10 19:32:36,210 INFO L226 Difference]: Without dead ends: 139515 [2020-02-10 19:32:36,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:32:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139515 states. [2020-02-10 19:32:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139515 to 139515. [2020-02-10 19:32:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139515 states. [2020-02-10 19:32:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139515 states to 139515 states and 956551 transitions. [2020-02-10 19:32:52,961 INFO L78 Accepts]: Start accepts. Automaton has 139515 states and 956551 transitions. Word has length 34 [2020-02-10 19:32:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:52,961 INFO L479 AbstractCegarLoop]: Abstraction has 139515 states and 956551 transitions. [2020-02-10 19:32:52,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:32:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 139515 states and 956551 transitions. [2020-02-10 19:32:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:32:53,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:53,360 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:53,361 INFO L82 PathProgramCache]: Analyzing trace with hash -457460980, now seen corresponding path program 1 times [2020-02-10 19:32:53,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:53,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233595146] [2020-02-10 19:32:53,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:53,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233595146] [2020-02-10 19:32:53,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:53,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:32:53,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667694472] [2020-02-10 19:32:53,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:32:53,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:32:53,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:32:53,411 INFO L87 Difference]: Start difference. First operand 139515 states and 956551 transitions. Second operand 3 states. [2020-02-10 19:33:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:00,577 INFO L93 Difference]: Finished difference Result 88603 states and 587879 transitions. [2020-02-10 19:33:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:00,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:00,908 INFO L225 Difference]: With dead ends: 88603 [2020-02-10 19:33:00,909 INFO L226 Difference]: Without dead ends: 88603 [2020-02-10 19:33:00,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88603 states. [2020-02-10 19:33:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88603 to 88603. [2020-02-10 19:33:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88603 states. [2020-02-10 19:33:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88603 states to 88603 states and 587879 transitions. [2020-02-10 19:33:07,369 INFO L78 Accepts]: Start accepts. Automaton has 88603 states and 587879 transitions. Word has length 34 [2020-02-10 19:33:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:07,369 INFO L479 AbstractCegarLoop]: Abstraction has 88603 states and 587879 transitions. [2020-02-10 19:33:07,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88603 states and 587879 transitions. [2020-02-10 19:33:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:07,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:07,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:07,608 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2006703282, now seen corresponding path program 1 times [2020-02-10 19:33:07,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:07,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221829962] [2020-02-10 19:33:07,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:07,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221829962] [2020-02-10 19:33:07,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:07,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:07,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412369982] [2020-02-10 19:33:07,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:07,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:07,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:07,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:07,656 INFO L87 Difference]: Start difference. First operand 88603 states and 587879 transitions. Second operand 3 states. [2020-02-10 19:33:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:08,198 INFO L93 Difference]: Finished difference Result 76827 states and 490855 transitions. [2020-02-10 19:33:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:08,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:09,628 INFO L225 Difference]: With dead ends: 76827 [2020-02-10 19:33:09,628 INFO L226 Difference]: Without dead ends: 76827 [2020-02-10 19:33:09,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76827 states. [2020-02-10 19:33:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76827 to 76827. [2020-02-10 19:33:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76827 states. [2020-02-10 19:33:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76827 states to 76827 states and 490855 transitions. [2020-02-10 19:33:20,318 INFO L78 Accepts]: Start accepts. Automaton has 76827 states and 490855 transitions. Word has length 34 [2020-02-10 19:33:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:20,318 INFO L479 AbstractCegarLoop]: Abstraction has 76827 states and 490855 transitions. [2020-02-10 19:33:20,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 76827 states and 490855 transitions. [2020-02-10 19:33:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:20,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:20,518 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1312454640, now seen corresponding path program 1 times [2020-02-10 19:33:20,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:20,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303498800] [2020-02-10 19:33:20,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:20,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303498800] [2020-02-10 19:33:20,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:20,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:20,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504042133] [2020-02-10 19:33:20,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:20,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:20,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:20,546 INFO L87 Difference]: Start difference. First operand 76827 states and 490855 transitions. Second operand 3 states. [2020-02-10 19:33:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:20,872 INFO L93 Difference]: Finished difference Result 46747 states and 286439 transitions. [2020-02-10 19:33:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:21,028 INFO L225 Difference]: With dead ends: 46747 [2020-02-10 19:33:21,028 INFO L226 Difference]: Without dead ends: 46747 [2020-02-10 19:33:21,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46747 states. [2020-02-10 19:33:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46747 to 46747. [2020-02-10 19:33:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46747 states. [2020-02-10 19:33:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46747 states to 46747 states and 286439 transitions. [2020-02-10 19:33:30,025 INFO L78 Accepts]: Start accepts. Automaton has 46747 states and 286439 transitions. Word has length 34 [2020-02-10 19:33:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:30,026 INFO L479 AbstractCegarLoop]: Abstraction has 46747 states and 286439 transitions. [2020-02-10 19:33:30,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46747 states and 286439 transitions. [2020-02-10 19:33:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:30,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:30,132 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1656741828, now seen corresponding path program 1 times [2020-02-10 19:33:30,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:30,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328439083] [2020-02-10 19:33:30,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328439083] [2020-02-10 19:33:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:30,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:30,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141452421] [2020-02-10 19:33:30,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:30,175 INFO L87 Difference]: Start difference. First operand 46747 states and 286439 transitions. Second operand 3 states. [2020-02-10 19:33:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:30,364 INFO L93 Difference]: Finished difference Result 28571 states and 167207 transitions. [2020-02-10 19:33:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:30,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:30,450 INFO L225 Difference]: With dead ends: 28571 [2020-02-10 19:33:30,450 INFO L226 Difference]: Without dead ends: 28571 [2020-02-10 19:33:30,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28571 states. [2020-02-10 19:33:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28571 to 28571. [2020-02-10 19:33:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28571 states. [2020-02-10 19:33:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28571 states to 28571 states and 167207 transitions. [2020-02-10 19:33:32,341 INFO L78 Accepts]: Start accepts. Automaton has 28571 states and 167207 transitions. Word has length 34 [2020-02-10 19:33:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:32,341 INFO L479 AbstractCegarLoop]: Abstraction has 28571 states and 167207 transitions. [2020-02-10 19:33:32,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28571 states and 167207 transitions. [2020-02-10 19:33:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:32,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:32,401 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash 654666270, now seen corresponding path program 1 times [2020-02-10 19:33:32,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:32,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876734130] [2020-02-10 19:33:32,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:32,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876734130] [2020-02-10 19:33:32,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:32,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:32,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852103283] [2020-02-10 19:33:32,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:32,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:32,458 INFO L87 Difference]: Start difference. First operand 28571 states and 167207 transitions. Second operand 3 states. [2020-02-10 19:33:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:32,609 INFO L93 Difference]: Finished difference Result 18139 states and 100871 transitions. [2020-02-10 19:33:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:32,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:32,659 INFO L225 Difference]: With dead ends: 18139 [2020-02-10 19:33:32,659 INFO L226 Difference]: Without dead ends: 18139 [2020-02-10 19:33:32,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18139 states. [2020-02-10 19:33:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18139 to 18139. [2020-02-10 19:33:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18139 states. [2020-02-10 19:33:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18139 states to 18139 states and 100871 transitions. [2020-02-10 19:33:33,726 INFO L78 Accepts]: Start accepts. Automaton has 18139 states and 100871 transitions. Word has length 34 [2020-02-10 19:33:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:33,726 INFO L479 AbstractCegarLoop]: Abstraction has 18139 states and 100871 transitions. [2020-02-10 19:33:33,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18139 states and 100871 transitions. [2020-02-10 19:33:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:33,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:33,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:33,761 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1250911260, now seen corresponding path program 1 times [2020-02-10 19:33:33,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:33,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413615958] [2020-02-10 19:33:33,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:33,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413615958] [2020-02-10 19:33:33,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:33,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:33,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728528834] [2020-02-10 19:33:33,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:33,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:33,798 INFO L87 Difference]: Start difference. First operand 18139 states and 100871 transitions. Second operand 3 states. [2020-02-10 19:33:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:33,898 INFO L93 Difference]: Finished difference Result 10215 states and 56299 transitions. [2020-02-10 19:33:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:33,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:33,937 INFO L225 Difference]: With dead ends: 10215 [2020-02-10 19:33:33,937 INFO L226 Difference]: Without dead ends: 10215 [2020-02-10 19:33:33,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2020-02-10 19:33:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 10215. [2020-02-10 19:33:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10215 states. [2020-02-10 19:33:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 56299 transitions. [2020-02-10 19:33:34,917 INFO L78 Accepts]: Start accepts. Automaton has 10215 states and 56299 transitions. Word has length 34 [2020-02-10 19:33:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:34,917 INFO L479 AbstractCegarLoop]: Abstraction has 10215 states and 56299 transitions. [2020-02-10 19:33:34,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10215 states and 56299 transitions. [2020-02-10 19:33:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:34,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:34,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:34,941 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash -953380640, now seen corresponding path program 1 times [2020-02-10 19:33:34,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:34,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158024138] [2020-02-10 19:33:34,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:34,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158024138] [2020-02-10 19:33:34,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:34,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:33:34,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965013554] [2020-02-10 19:33:34,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:33:34,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:33:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:34,980 INFO L87 Difference]: Start difference. First operand 10215 states and 56299 transitions. Second operand 3 states. [2020-02-10 19:33:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:35,027 INFO L93 Difference]: Finished difference Result 6143 states and 33793 transitions. [2020-02-10 19:33:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:33:35,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:33:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:35,047 INFO L225 Difference]: With dead ends: 6143 [2020-02-10 19:33:35,047 INFO L226 Difference]: Without dead ends: 6143 [2020-02-10 19:33:35,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:33:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-02-10 19:33:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 6143. [2020-02-10 19:33:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2020-02-10 19:33:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 33793 transitions. [2020-02-10 19:33:35,574 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 33793 transitions. Word has length 34 [2020-02-10 19:33:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:35,574 INFO L479 AbstractCegarLoop]: Abstraction has 6143 states and 33793 transitions. [2020-02-10 19:33:35,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:33:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 33793 transitions. [2020-02-10 19:33:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:35,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:35,589 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1707014504, now seen corresponding path program 1 times [2020-02-10 19:33:35,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:35,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266761659] [2020-02-10 19:33:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:36,369 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 19:33:36,531 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:36,710 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:33:36,877 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:33:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:36,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266761659] [2020-02-10 19:33:36,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:36,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:36,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550371319] [2020-02-10 19:33:36,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:36,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:36,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:36,896 INFO L87 Difference]: Start difference. First operand 6143 states and 33793 transitions. Second operand 13 states. [2020-02-10 19:33:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:37,241 INFO L93 Difference]: Finished difference Result 11891 states and 58611 transitions. [2020-02-10 19:33:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:37,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:37,271 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 19:33:37,271 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 19:33:37,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 19:33:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6225. [2020-02-10 19:33:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:33:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34181 transitions. [2020-02-10 19:33:38,081 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34181 transitions. Word has length 34 [2020-02-10 19:33:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:38,081 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34181 transitions. [2020-02-10 19:33:38,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34181 transitions. [2020-02-10 19:33:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:38,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:38,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:38,097 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1070547650, now seen corresponding path program 2 times [2020-02-10 19:33:38,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:38,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936978852] [2020-02-10 19:33:38,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:38,812 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:38,997 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:33:39,166 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:33:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:39,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936978852] [2020-02-10 19:33:39,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:39,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:39,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720140934] [2020-02-10 19:33:39,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:39,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:39,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:39,179 INFO L87 Difference]: Start difference. First operand 6225 states and 34181 transitions. Second operand 13 states. [2020-02-10 19:33:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:39,581 INFO L93 Difference]: Finished difference Result 11889 states and 58597 transitions. [2020-02-10 19:33:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:39,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:39,611 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 19:33:39,611 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 19:33:39,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 19:33:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6213. [2020-02-10 19:33:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:33:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34151 transitions. [2020-02-10 19:33:40,277 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34151 transitions. Word has length 34 [2020-02-10 19:33:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:40,277 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34151 transitions. [2020-02-10 19:33:40,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34151 transitions. [2020-02-10 19:33:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:40,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:40,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:40,289 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash -824698088, now seen corresponding path program 3 times [2020-02-10 19:33:40,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:40,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055293569] [2020-02-10 19:33:40,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:41,094 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:33:41,250 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:41,417 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:33:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:41,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055293569] [2020-02-10 19:33:41,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:41,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:41,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881220980] [2020-02-10 19:33:41,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:41,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:41,433 INFO L87 Difference]: Start difference. First operand 6213 states and 34151 transitions. Second operand 13 states. [2020-02-10 19:33:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:41,821 INFO L93 Difference]: Finished difference Result 11879 states and 58577 transitions. [2020-02-10 19:33:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:41,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:41,863 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 19:33:41,863 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:33:41,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:33:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6221. [2020-02-10 19:33:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:33:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34166 transitions. [2020-02-10 19:33:42,656 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34166 transitions. Word has length 34 [2020-02-10 19:33:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:42,656 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34166 transitions. [2020-02-10 19:33:42,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34166 transitions. [2020-02-10 19:33:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:42,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:42,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:42,668 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1809634372, now seen corresponding path program 4 times [2020-02-10 19:33:42,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:42,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23813356] [2020-02-10 19:33:42,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:43,468 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:33:43,615 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:33:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:43,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23813356] [2020-02-10 19:33:43,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:43,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:43,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221717691] [2020-02-10 19:33:43,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:43,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:43,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:43,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:43,627 INFO L87 Difference]: Start difference. First operand 6221 states and 34166 transitions. Second operand 13 states. [2020-02-10 19:33:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:43,959 INFO L93 Difference]: Finished difference Result 11884 states and 58579 transitions. [2020-02-10 19:33:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:43,960 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:43,989 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:33:43,989 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:33:43,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:33:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6213. [2020-02-10 19:33:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:33:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34143 transitions. [2020-02-10 19:33:44,617 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34143 transitions. Word has length 34 [2020-02-10 19:33:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:44,617 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34143 transitions. [2020-02-10 19:33:44,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34143 transitions. [2020-02-10 19:33:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:44,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:44,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:44,628 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 919665918, now seen corresponding path program 5 times [2020-02-10 19:33:44,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:44,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889624937] [2020-02-10 19:33:44,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:45,398 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:33:45,558 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:33:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:45,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889624937] [2020-02-10 19:33:45,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:45,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:45,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919124189] [2020-02-10 19:33:45,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:45,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:45,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:45,577 INFO L87 Difference]: Start difference. First operand 6213 states and 34143 transitions. Second operand 13 states. [2020-02-10 19:33:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:45,947 INFO L93 Difference]: Finished difference Result 11876 states and 58564 transitions. [2020-02-10 19:33:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:45,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:45,978 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 19:33:45,978 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 19:33:45,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 19:33:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6220. [2020-02-10 19:33:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:33:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34156 transitions. [2020-02-10 19:33:46,732 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34156 transitions. Word has length 34 [2020-02-10 19:33:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:46,732 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34156 transitions. [2020-02-10 19:33:46,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34156 transitions. [2020-02-10 19:33:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:46,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:46,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:46,744 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash 711203164, now seen corresponding path program 6 times [2020-02-10 19:33:46,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:46,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784891081] [2020-02-10 19:33:46,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:47,532 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:33:47,665 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:33:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:47,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784891081] [2020-02-10 19:33:47,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:47,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:47,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145219845] [2020-02-10 19:33:47,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:47,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:47,678 INFO L87 Difference]: Start difference. First operand 6220 states and 34156 transitions. Second operand 13 states. [2020-02-10 19:33:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:48,082 INFO L93 Difference]: Finished difference Result 11879 states and 58563 transitions. [2020-02-10 19:33:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:48,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:48,112 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 19:33:48,112 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 19:33:48,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 19:33:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6204. [2020-02-10 19:33:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:33:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34119 transitions. [2020-02-10 19:33:48,746 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34119 transitions. Word has length 34 [2020-02-10 19:33:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:48,746 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34119 transitions. [2020-02-10 19:33:48,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34119 transitions. [2020-02-10 19:33:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:48,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:48,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:48,758 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:48,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2028412534, now seen corresponding path program 7 times [2020-02-10 19:33:48,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:48,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001451166] [2020-02-10 19:33:48,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:49,384 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:49,544 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:33:49,690 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:33:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:49,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001451166] [2020-02-10 19:33:49,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:49,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:49,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605422544] [2020-02-10 19:33:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:49,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:49,703 INFO L87 Difference]: Start difference. First operand 6204 states and 34119 transitions. Second operand 13 states. [2020-02-10 19:33:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:49,954 INFO L93 Difference]: Finished difference Result 11900 states and 58627 transitions. [2020-02-10 19:33:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:49,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:49,984 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:33:49,984 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 19:33:49,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 19:33:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6228. [2020-02-10 19:33:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:33:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 19:33:50,735 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 19:33:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:50,735 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 19:33:50,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 19:33:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:50,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:50,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:50,747 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1391945680, now seen corresponding path program 8 times [2020-02-10 19:33:50,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:50,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570544057] [2020-02-10 19:33:50,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:51,305 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-02-10 19:33:51,462 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:51,604 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:33:51,763 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:33:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:51,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570544057] [2020-02-10 19:33:51,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:51,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:51,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982539411] [2020-02-10 19:33:51,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:51,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:51,795 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 19:33:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:52,164 INFO L93 Difference]: Finished difference Result 11898 states and 58613 transitions. [2020-02-10 19:33:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:52,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:52,194 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 19:33:52,195 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 19:33:52,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 19:33:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6216. [2020-02-10 19:33:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:33:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34149 transitions. [2020-02-10 19:33:52,817 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34149 transitions. Word has length 34 [2020-02-10 19:33:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:52,818 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34149 transitions. [2020-02-10 19:33:52,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34149 transitions. [2020-02-10 19:33:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:52,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:52,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:52,830 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1338535332, now seen corresponding path program 9 times [2020-02-10 19:33:52,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:52,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937625766] [2020-02-10 19:33:52,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:53,469 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:53,635 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:33:53,790 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:33:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:53,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937625766] [2020-02-10 19:33:53,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:53,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:53,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013588848] [2020-02-10 19:33:53,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:53,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:53,803 INFO L87 Difference]: Start difference. First operand 6216 states and 34149 transitions. Second operand 13 states. [2020-02-10 19:33:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:54,065 INFO L93 Difference]: Finished difference Result 11897 states and 58610 transitions. [2020-02-10 19:33:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:54,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:54,095 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 19:33:54,098 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 19:33:54,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 19:33:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6226. [2020-02-10 19:33:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 19:33:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34167 transitions. [2020-02-10 19:33:54,851 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34167 transitions. Word has length 34 [2020-02-10 19:33:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:54,851 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34167 transitions. [2020-02-10 19:33:54,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34167 transitions. [2020-02-10 19:33:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:54,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:54,862 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1259187020, now seen corresponding path program 10 times [2020-02-10 19:33:54,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:54,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113317684] [2020-02-10 19:33:54,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:55,616 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:33:55,766 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:33:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:55,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113317684] [2020-02-10 19:33:55,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:55,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:55,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575633264] [2020-02-10 19:33:55,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:55,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:55,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:55,779 INFO L87 Difference]: Start difference. First operand 6226 states and 34167 transitions. Second operand 13 states. [2020-02-10 19:33:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:56,088 INFO L93 Difference]: Finished difference Result 11894 states and 58595 transitions. [2020-02-10 19:33:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:56,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:56,119 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 19:33:56,119 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 19:33:56,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 19:33:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6216. [2020-02-10 19:33:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:33:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34139 transitions. [2020-02-10 19:33:56,745 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34139 transitions. Word has length 34 [2020-02-10 19:33:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:56,745 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34139 transitions. [2020-02-10 19:33:56,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34139 transitions. [2020-02-10 19:33:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:56,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:56,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:56,757 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash -230638180, now seen corresponding path program 11 times [2020-02-10 19:33:56,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:56,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152291292] [2020-02-10 19:33:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:57,387 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:57,532 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:33:57,691 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:33:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:57,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152291292] [2020-02-10 19:33:57,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:57,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:57,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343678663] [2020-02-10 19:33:57,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:57,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:57,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:57,705 INFO L87 Difference]: Start difference. First operand 6216 states and 34139 transitions. Second operand 13 states. [2020-02-10 19:33:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:58,010 INFO L93 Difference]: Finished difference Result 11892 states and 58592 transitions. [2020-02-10 19:33:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:33:58,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:33:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:58,039 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 19:33:58,039 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 19:33:58,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:33:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 19:33:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6225. [2020-02-10 19:33:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:33:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34156 transitions. [2020-02-10 19:33:58,796 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34156 transitions. Word has length 34 [2020-02-10 19:33:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:58,796 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34156 transitions. [2020-02-10 19:33:58,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:33:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34156 transitions. [2020-02-10 19:33:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:33:58,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:58,808 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1291416270, now seen corresponding path program 12 times [2020-02-10 19:33:58,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:58,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041663978] [2020-02-10 19:33:58,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:59,288 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-02-10 19:33:59,413 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:59,573 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:33:59,717 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:33:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:59,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041663978] [2020-02-10 19:33:59,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:59,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:33:59,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088397877] [2020-02-10 19:33:59,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:33:59,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:59,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:33:59,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:59,730 INFO L87 Difference]: Start difference. First operand 6225 states and 34156 transitions. Second operand 13 states. [2020-02-10 19:34:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:00,164 INFO L93 Difference]: Finished difference Result 11891 states and 58581 transitions. [2020-02-10 19:34:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:00,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:00,196 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 19:34:00,197 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 19:34:00,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 19:34:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6204. [2020-02-10 19:34:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:34:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34109 transitions. [2020-02-10 19:34:00,818 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34109 transitions. Word has length 34 [2020-02-10 19:34:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:00,819 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34109 transitions. [2020-02-10 19:34:00,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34109 transitions. [2020-02-10 19:34:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:00,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:00,830 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2120866830, now seen corresponding path program 13 times [2020-02-10 19:34:00,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:00,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975313713] [2020-02-10 19:34:00,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:01,419 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:34:01,563 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:01,718 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:01,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975313713] [2020-02-10 19:34:01,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:01,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:01,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221497847] [2020-02-10 19:34:01,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:01,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:01,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:01,731 INFO L87 Difference]: Start difference. First operand 6204 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:34:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:02,044 INFO L93 Difference]: Finished difference Result 11875 states and 58559 transitions. [2020-02-10 19:34:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:02,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:02,073 INFO L225 Difference]: With dead ends: 11875 [2020-02-10 19:34:02,073 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 19:34:02,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 19:34:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6220. [2020-02-10 19:34:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:34:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34154 transitions. [2020-02-10 19:34:02,835 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34154 transitions. Word has length 34 [2020-02-10 19:34:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:02,836 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34154 transitions. [2020-02-10 19:34:02,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34154 transitions. [2020-02-10 19:34:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:02,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:02,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:02,847 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1189164182, now seen corresponding path program 14 times [2020-02-10 19:34:02,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:02,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559197346] [2020-02-10 19:34:02,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:03,416 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:34:03,567 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:34:03,723 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:03,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559197346] [2020-02-10 19:34:03,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:03,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:03,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990394234] [2020-02-10 19:34:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:03,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:03,736 INFO L87 Difference]: Start difference. First operand 6220 states and 34154 transitions. Second operand 13 states. [2020-02-10 19:34:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:04,023 INFO L93 Difference]: Finished difference Result 11880 states and 58561 transitions. [2020-02-10 19:34:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:04,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:04,052 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 19:34:04,053 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 19:34:04,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 19:34:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6212. [2020-02-10 19:34:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:34:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34131 transitions. [2020-02-10 19:34:04,683 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34131 transitions. Word has length 34 [2020-02-10 19:34:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:04,684 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34131 transitions. [2020-02-10 19:34:04,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34131 transitions. [2020-02-10 19:34:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:04,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:04,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:04,700 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1099114754, now seen corresponding path program 15 times [2020-02-10 19:34:04,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:04,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988877682] [2020-02-10 19:34:04,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:05,424 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:05,572 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:05,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988877682] [2020-02-10 19:34:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665581617] [2020-02-10 19:34:05,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:05,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:05,587 INFO L87 Difference]: Start difference. First operand 6212 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:34:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:05,973 INFO L93 Difference]: Finished difference Result 11871 states and 58544 transitions. [2020-02-10 19:34:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:05,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:06,002 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 19:34:06,003 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:34:06,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:34:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 19:34:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:34:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34144 transitions. [2020-02-10 19:34:06,776 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34144 transitions. Word has length 34 [2020-02-10 19:34:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:06,776 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34144 transitions. [2020-02-10 19:34:06,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34144 transitions. [2020-02-10 19:34:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:06,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:06,788 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1779692234, now seen corresponding path program 16 times [2020-02-10 19:34:06,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:06,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573572293] [2020-02-10 19:34:06,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:07,474 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:34:07,622 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:07,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573572293] [2020-02-10 19:34:07,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:07,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:07,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183598905] [2020-02-10 19:34:07,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:07,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:07,634 INFO L87 Difference]: Start difference. First operand 6219 states and 34144 transitions. Second operand 13 states. [2020-02-10 19:34:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:07,983 INFO L93 Difference]: Finished difference Result 11873 states and 58541 transitions. [2020-02-10 19:34:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:07,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:08,013 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 19:34:08,013 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 19:34:08,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 19:34:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6212. [2020-02-10 19:34:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:34:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34124 transitions. [2020-02-10 19:34:08,641 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34124 transitions. Word has length 34 [2020-02-10 19:34:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:08,642 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34124 transitions. [2020-02-10 19:34:08,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34124 transitions. [2020-02-10 19:34:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:08,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:08,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:08,654 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2140460770, now seen corresponding path program 17 times [2020-02-10 19:34:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:08,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671930640] [2020-02-10 19:34:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:09,234 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:09,385 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:34:09,562 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:09,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671930640] [2020-02-10 19:34:09,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:09,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:09,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367598876] [2020-02-10 19:34:09,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:09,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:09,576 INFO L87 Difference]: Start difference. First operand 6212 states and 34124 transitions. Second operand 13 states. [2020-02-10 19:34:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:09,937 INFO L93 Difference]: Finished difference Result 11884 states and 58563 transitions. [2020-02-10 19:34:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:09,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:09,966 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:34:09,967 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:34:09,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:34:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6222. [2020-02-10 19:34:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:34:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34142 transitions. [2020-02-10 19:34:10,578 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34142 transitions. Word has length 34 [2020-02-10 19:34:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:10,578 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34142 transitions. [2020-02-10 19:34:10,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34142 transitions. [2020-02-10 19:34:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:10,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:10,740 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash 887244786, now seen corresponding path program 18 times [2020-02-10 19:34:10,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:10,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666847718] [2020-02-10 19:34:10,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:11,313 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:11,456 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:34:11,606 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:34:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:11,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666847718] [2020-02-10 19:34:11,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:11,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:11,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942912564] [2020-02-10 19:34:11,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:11,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:11,618 INFO L87 Difference]: Start difference. First operand 6222 states and 34142 transitions. Second operand 13 states. [2020-02-10 19:34:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:11,975 INFO L93 Difference]: Finished difference Result 11881 states and 58548 transitions. [2020-02-10 19:34:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:11,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:12,006 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 19:34:12,006 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 19:34:12,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 19:34:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 19:34:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:34:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34101 transitions. [2020-02-10 19:34:12,632 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34101 transitions. Word has length 34 [2020-02-10 19:34:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:12,632 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34101 transitions. [2020-02-10 19:34:12,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34101 transitions. [2020-02-10 19:34:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:12,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:12,644 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2135793486, now seen corresponding path program 19 times [2020-02-10 19:34:12,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:12,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448616575] [2020-02-10 19:34:12,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:13,371 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:34:13,521 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:13,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448616575] [2020-02-10 19:34:13,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:13,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:13,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956984495] [2020-02-10 19:34:13,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:13,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:13,535 INFO L87 Difference]: Start difference. First operand 6204 states and 34101 transitions. Second operand 13 states. [2020-02-10 19:34:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:13,851 INFO L93 Difference]: Finished difference Result 11867 states and 58536 transitions. [2020-02-10 19:34:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:13,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:13,881 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 19:34:13,881 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 19:34:13,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 19:34:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6218. [2020-02-10 19:34:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:34:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34141 transitions. [2020-02-10 19:34:14,501 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34141 transitions. Word has length 34 [2020-02-10 19:34:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:14,501 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34141 transitions. [2020-02-10 19:34:14,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34141 transitions. [2020-02-10 19:34:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:14,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:14,512 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1950711056, now seen corresponding path program 20 times [2020-02-10 19:34:14,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:14,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313286338] [2020-02-10 19:34:14,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:15,422 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:15,575 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:15,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313286338] [2020-02-10 19:34:15,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:15,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:15,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081630004] [2020-02-10 19:34:15,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:15,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:15,588 INFO L87 Difference]: Start difference. First operand 6218 states and 34141 transitions. Second operand 13 states. [2020-02-10 19:34:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:15,931 INFO L93 Difference]: Finished difference Result 11870 states and 58535 transitions. [2020-02-10 19:34:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:15,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:15,961 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 19:34:15,962 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 19:34:15,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 19:34:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6211. [2020-02-10 19:34:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:34:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34121 transitions. [2020-02-10 19:34:16,580 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34121 transitions. Word has length 34 [2020-02-10 19:34:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:16,580 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34121 transitions. [2020-02-10 19:34:16,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34121 transitions. [2020-02-10 19:34:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:16,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:16,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:16,592 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -660175908, now seen corresponding path program 21 times [2020-02-10 19:34:16,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:16,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441210511] [2020-02-10 19:34:16,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:17,295 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:34:17,445 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:34:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:17,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441210511] [2020-02-10 19:34:17,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:17,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:17,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663989989] [2020-02-10 19:34:17,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:17,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:17,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:17,458 INFO L87 Difference]: Start difference. First operand 6211 states and 34121 transitions. Second operand 13 states. [2020-02-10 19:34:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:17,800 INFO L93 Difference]: Finished difference Result 11866 states and 58527 transitions. [2020-02-10 19:34:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:17,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:17,830 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 19:34:17,831 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 19:34:17,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 19:34:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6218. [2020-02-10 19:34:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:34:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34134 transitions. [2020-02-10 19:34:18,450 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34134 transitions. Word has length 34 [2020-02-10 19:34:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:18,450 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34134 transitions. [2020-02-10 19:34:18,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34134 transitions. [2020-02-10 19:34:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:18,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:18,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:18,462 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash 755984400, now seen corresponding path program 22 times [2020-02-10 19:34:18,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:18,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257196702] [2020-02-10 19:34:18,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:18,927 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 19:34:19,064 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-02-10 19:34:19,336 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:34:19,670 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:34:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257196702] [2020-02-10 19:34:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:19,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:19,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571391627] [2020-02-10 19:34:19,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:19,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:19,690 INFO L87 Difference]: Start difference. First operand 6218 states and 34134 transitions. Second operand 13 states. [2020-02-10 19:34:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:20,120 INFO L93 Difference]: Finished difference Result 11868 states and 58524 transitions. [2020-02-10 19:34:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:20,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:20,151 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 19:34:20,152 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 19:34:20,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 19:34:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6211. [2020-02-10 19:34:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:34:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34114 transitions. [2020-02-10 19:34:20,770 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34114 transitions. Word has length 34 [2020-02-10 19:34:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:20,771 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34114 transitions. [2020-02-10 19:34:20,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34114 transitions. [2020-02-10 19:34:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:20,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:20,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:20,782 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1392959652, now seen corresponding path program 23 times [2020-02-10 19:34:20,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:20,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086578790] [2020-02-10 19:34:20,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:21,488 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:21,638 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:21,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086578790] [2020-02-10 19:34:21,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:21,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:21,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224780872] [2020-02-10 19:34:21,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:21,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:21,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:21,650 INFO L87 Difference]: Start difference. First operand 6211 states and 34114 transitions. Second operand 13 states. [2020-02-10 19:34:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:22,044 INFO L93 Difference]: Finished difference Result 11874 states and 58538 transitions. [2020-02-10 19:34:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:22,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:22,073 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 19:34:22,073 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:34:22,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:34:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6220. [2020-02-10 19:34:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:34:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34131 transitions. [2020-02-10 19:34:22,693 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34131 transitions. Word has length 34 [2020-02-10 19:34:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:22,693 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34131 transitions. [2020-02-10 19:34:22,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34131 transitions. [2020-02-10 19:34:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:22,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:22,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:22,705 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1411393678, now seen corresponding path program 24 times [2020-02-10 19:34:22,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:22,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455073489] [2020-02-10 19:34:22,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:23,245 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:23,392 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:34:23,549 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:34:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:23,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455073489] [2020-02-10 19:34:23,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:23,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:23,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726019098] [2020-02-10 19:34:23,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:23,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:23,561 INFO L87 Difference]: Start difference. First operand 6220 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:34:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:24,041 INFO L93 Difference]: Finished difference Result 11873 states and 58527 transitions. [2020-02-10 19:34:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:24,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:24,073 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 19:34:24,073 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 19:34:24,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 19:34:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6194. [2020-02-10 19:34:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 19:34:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34076 transitions. [2020-02-10 19:34:24,687 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34076 transitions. Word has length 34 [2020-02-10 19:34:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:24,687 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34076 transitions. [2020-02-10 19:34:24,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34076 transitions. [2020-02-10 19:34:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:24,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:24,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:24,699 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1529260104, now seen corresponding path program 25 times [2020-02-10 19:34:24,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:24,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383286343] [2020-02-10 19:34:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:25,299 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:25,452 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:25,600 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:25,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383286343] [2020-02-10 19:34:25,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:25,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:25,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075948850] [2020-02-10 19:34:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:25,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:25,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:25,612 INFO L87 Difference]: Start difference. First operand 6194 states and 34076 transitions. Second operand 13 states. [2020-02-10 19:34:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:25,948 INFO L93 Difference]: Finished difference Result 11873 states and 58547 transitions. [2020-02-10 19:34:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:25,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:25,978 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 19:34:25,978 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 19:34:25,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 19:34:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6223. [2020-02-10 19:34:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:34:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34165 transitions. [2020-02-10 19:34:26,601 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34165 transitions. Word has length 34 [2020-02-10 19:34:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:26,602 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34165 transitions. [2020-02-10 19:34:26,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34165 transitions. [2020-02-10 19:34:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:26,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:26,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:26,612 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2129240338, now seen corresponding path program 26 times [2020-02-10 19:34:26,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:26,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980165296] [2020-02-10 19:34:26,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:27,177 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:27,325 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:27,502 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:27,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980165296] [2020-02-10 19:34:27,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:27,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:27,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634188599] [2020-02-10 19:34:27,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:27,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:27,515 INFO L87 Difference]: Start difference. First operand 6223 states and 34165 transitions. Second operand 13 states. [2020-02-10 19:34:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:28,022 INFO L93 Difference]: Finished difference Result 11871 states and 58533 transitions. [2020-02-10 19:34:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:28,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:28,052 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 19:34:28,053 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 19:34:28,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 19:34:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6211. [2020-02-10 19:34:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:34:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34135 transitions. [2020-02-10 19:34:28,819 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34135 transitions. Word has length 34 [2020-02-10 19:34:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:28,819 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34135 transitions. [2020-02-10 19:34:28,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34135 transitions. [2020-02-10 19:34:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:28,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:28,830 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 233994600, now seen corresponding path program 27 times [2020-02-10 19:34:28,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:28,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364425703] [2020-02-10 19:34:28,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:29,397 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:34:29,543 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:29,689 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:29,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364425703] [2020-02-10 19:34:29,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:29,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:29,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22151320] [2020-02-10 19:34:29,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:29,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:29,702 INFO L87 Difference]: Start difference. First operand 6211 states and 34135 transitions. Second operand 13 states. [2020-02-10 19:34:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:30,180 INFO L93 Difference]: Finished difference Result 11861 states and 58513 transitions. [2020-02-10 19:34:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:30,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:30,210 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 19:34:30,210 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 19:34:30,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 19:34:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6219. [2020-02-10 19:34:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:34:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34150 transitions. [2020-02-10 19:34:30,834 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34150 transitions. Word has length 34 [2020-02-10 19:34:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:30,835 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34150 transitions. [2020-02-10 19:34:30,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34150 transitions. [2020-02-10 19:34:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:30,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:30,846 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:30,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:30,846 INFO L82 PathProgramCache]: Analyzing trace with hash -750941684, now seen corresponding path program 28 times [2020-02-10 19:34:30,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:30,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521610156] [2020-02-10 19:34:30,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:31,427 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:34:31,580 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:31,734 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:31,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521610156] [2020-02-10 19:34:31,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:31,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:31,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526220634] [2020-02-10 19:34:31,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:31,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:31,746 INFO L87 Difference]: Start difference. First operand 6219 states and 34150 transitions. Second operand 13 states. [2020-02-10 19:34:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:32,118 INFO L93 Difference]: Finished difference Result 11866 states and 58515 transitions. [2020-02-10 19:34:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:32,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:32,148 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 19:34:32,148 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 19:34:32,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 19:34:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6211. [2020-02-10 19:34:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:34:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34127 transitions. [2020-02-10 19:34:32,919 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34127 transitions. Word has length 34 [2020-02-10 19:34:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:32,919 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34127 transitions. [2020-02-10 19:34:32,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34127 transitions. [2020-02-10 19:34:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:32,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:32,931 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1978358606, now seen corresponding path program 29 times [2020-02-10 19:34:32,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:32,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493001812] [2020-02-10 19:34:32,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:33,640 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:34:33,789 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:33,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493001812] [2020-02-10 19:34:33,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:33,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:33,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551242086] [2020-02-10 19:34:33,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:33,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:33,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:33,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:33,801 INFO L87 Difference]: Start difference. First operand 6211 states and 34127 transitions. Second operand 13 states. [2020-02-10 19:34:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:34,099 INFO L93 Difference]: Finished difference Result 11858 states and 58500 transitions. [2020-02-10 19:34:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:34,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:34,129 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 19:34:34,129 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 19:34:34,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 19:34:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6218. [2020-02-10 19:34:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:34:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34140 transitions. [2020-02-10 19:34:34,760 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34140 transitions. Word has length 34 [2020-02-10 19:34:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:34,760 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34140 transitions. [2020-02-10 19:34:34,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34140 transitions. [2020-02-10 19:34:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:34,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:34,771 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1769895852, now seen corresponding path program 30 times [2020-02-10 19:34:34,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:34,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688371327] [2020-02-10 19:34:34,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:35,332 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 19:34:35,477 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:35,623 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:35,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688371327] [2020-02-10 19:34:35,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:35,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:35,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336963364] [2020-02-10 19:34:35,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:35,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:35,635 INFO L87 Difference]: Start difference. First operand 6218 states and 34140 transitions. Second operand 13 states. [2020-02-10 19:34:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:35,941 INFO L93 Difference]: Finished difference Result 11861 states and 58499 transitions. [2020-02-10 19:34:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:35,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:35,970 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 19:34:35,970 INFO L226 Difference]: Without dead ends: 11823 [2020-02-10 19:34:35,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2020-02-10 19:34:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 6202. [2020-02-10 19:34:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 19:34:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34104 transitions. [2020-02-10 19:34:36,585 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34104 transitions. Word has length 34 [2020-02-10 19:34:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:36,585 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34104 transitions. [2020-02-10 19:34:36,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34104 transitions. [2020-02-10 19:34:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:36,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:36,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:36,600 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1935056908, now seen corresponding path program 31 times [2020-02-10 19:34:36,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:36,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425176547] [2020-02-10 19:34:36,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:37,167 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2020-02-10 19:34:37,297 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:37,452 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:37,601 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:37,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425176547] [2020-02-10 19:34:37,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514514696] [2020-02-10 19:34:37,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:37,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:37,614 INFO L87 Difference]: Start difference. First operand 6202 states and 34104 transitions. Second operand 13 states. [2020-02-10 19:34:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:37,890 INFO L93 Difference]: Finished difference Result 11869 states and 58527 transitions. [2020-02-10 19:34:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:37,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:37,921 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 19:34:37,921 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 19:34:37,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 19:34:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6222. [2020-02-10 19:34:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:34:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34153 transitions. [2020-02-10 19:34:38,544 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34153 transitions. Word has length 34 [2020-02-10 19:34:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:38,544 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34153 transitions. [2020-02-10 19:34:38,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34153 transitions. [2020-02-10 19:34:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:38,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:38,555 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1723443534, now seen corresponding path program 32 times [2020-02-10 19:34:38,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:38,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754512084] [2020-02-10 19:34:38,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:39,135 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:39,281 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:39,433 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:39,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754512084] [2020-02-10 19:34:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:39,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:39,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775659727] [2020-02-10 19:34:39,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:39,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:39,446 INFO L87 Difference]: Start difference. First operand 6222 states and 34153 transitions. Second operand 13 states. [2020-02-10 19:34:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:39,756 INFO L93 Difference]: Finished difference Result 11867 states and 58513 transitions. [2020-02-10 19:34:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:39,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:39,786 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 19:34:39,786 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 19:34:39,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 19:34:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6210. [2020-02-10 19:34:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:34:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34124 transitions. [2020-02-10 19:34:40,403 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34124 transitions. Word has length 34 [2020-02-10 19:34:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:40,403 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34124 transitions. [2020-02-10 19:34:40,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34124 transitions. [2020-02-10 19:34:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:40,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:40,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:40,415 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1134213844, now seen corresponding path program 33 times [2020-02-10 19:34:40,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:40,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089791389] [2020-02-10 19:34:40,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:41,131 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:41,280 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:41,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089791389] [2020-02-10 19:34:41,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:41,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:41,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174958655] [2020-02-10 19:34:41,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:41,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:41,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:41,293 INFO L87 Difference]: Start difference. First operand 6210 states and 34124 transitions. Second operand 13 states. [2020-02-10 19:34:41,606 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-02-10 19:34:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:41,631 INFO L93 Difference]: Finished difference Result 11860 states and 58498 transitions. [2020-02-10 19:34:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:41,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:41,665 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 19:34:41,665 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 19:34:41,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 19:34:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6217. [2020-02-10 19:34:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:34:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34136 transitions. [2020-02-10 19:34:42,285 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34136 transitions. Word has length 34 [2020-02-10 19:34:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:42,286 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34136 transitions. [2020-02-10 19:34:42,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34136 transitions. [2020-02-10 19:34:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:42,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:42,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:42,297 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1346369462, now seen corresponding path program 34 times [2020-02-10 19:34:42,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:42,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510438037] [2020-02-10 19:34:42,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:42,968 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:43,119 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:43,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510438037] [2020-02-10 19:34:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:43,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:43,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377830439] [2020-02-10 19:34:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:43,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:43,132 INFO L87 Difference]: Start difference. First operand 6217 states and 34136 transitions. Second operand 13 states. [2020-02-10 19:34:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:43,436 INFO L93 Difference]: Finished difference Result 11854 states and 58480 transitions. [2020-02-10 19:34:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:43,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:43,466 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 19:34:43,466 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 19:34:43,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 19:34:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 19:34:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:34:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34117 transitions. [2020-02-10 19:34:44,084 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34117 transitions. Word has length 34 [2020-02-10 19:34:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:44,085 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34117 transitions. [2020-02-10 19:34:44,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34117 transitions. [2020-02-10 19:34:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:44,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:44,096 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 397994544, now seen corresponding path program 35 times [2020-02-10 19:34:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694186937] [2020-02-10 19:34:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:44,781 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:34:44,928 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:44,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694186937] [2020-02-10 19:34:44,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:44,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:44,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349063929] [2020-02-10 19:34:44,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:44,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:44,941 INFO L87 Difference]: Start difference. First operand 6210 states and 34117 transitions. Second operand 13 states. [2020-02-10 19:34:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:45,240 INFO L93 Difference]: Finished difference Result 11851 states and 58475 transitions. [2020-02-10 19:34:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:45,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:45,269 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 19:34:45,269 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 19:34:45,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 19:34:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6216. [2020-02-10 19:34:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:34:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34128 transitions. [2020-02-10 19:34:45,991 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34128 transitions. Word has length 34 [2020-02-10 19:34:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:45,991 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34128 transitions. [2020-02-10 19:34:45,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34128 transitions. [2020-02-10 19:34:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:46,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:46,003 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:46,003 INFO L82 PathProgramCache]: Analyzing trace with hash -26316692, now seen corresponding path program 36 times [2020-02-10 19:34:46,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:46,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716796006] [2020-02-10 19:34:46,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:46,705 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:34:46,855 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:34:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:46,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716796006] [2020-02-10 19:34:46,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:46,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:46,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690481376] [2020-02-10 19:34:46,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:46,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:46,867 INFO L87 Difference]: Start difference. First operand 6216 states and 34128 transitions. Second operand 13 states. [2020-02-10 19:34:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:47,171 INFO L93 Difference]: Finished difference Result 11855 states and 58477 transitions. [2020-02-10 19:34:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:47,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:47,202 INFO L225 Difference]: With dead ends: 11855 [2020-02-10 19:34:47,202 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 19:34:47,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 19:34:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6202. [2020-02-10 19:34:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 19:34:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34096 transitions. [2020-02-10 19:34:47,823 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34096 transitions. Word has length 34 [2020-02-10 19:34:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:47,823 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34096 transitions. [2020-02-10 19:34:47,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34096 transitions. [2020-02-10 19:34:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:47,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:47,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:47,834 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -709674192, now seen corresponding path program 37 times [2020-02-10 19:34:47,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:47,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752749008] [2020-02-10 19:34:47,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:48,427 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:34:48,566 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:48,717 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752749008] [2020-02-10 19:34:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983338673] [2020-02-10 19:34:48,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:48,729 INFO L87 Difference]: Start difference. First operand 6202 states and 34096 transitions. Second operand 13 states. [2020-02-10 19:34:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:49,046 INFO L93 Difference]: Finished difference Result 11849 states and 58476 transitions. [2020-02-10 19:34:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:49,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:49,076 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 19:34:49,076 INFO L226 Difference]: Without dead ends: 11830 [2020-02-10 19:34:49,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11830 states. [2020-02-10 19:34:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11830 to 6217. [2020-02-10 19:34:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:34:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34137 transitions. [2020-02-10 19:34:49,702 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34137 transitions. Word has length 34 [2020-02-10 19:34:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:49,703 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34137 transitions. [2020-02-10 19:34:49,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34137 transitions. [2020-02-10 19:34:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:49,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:49,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:49,714 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:49,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1694610476, now seen corresponding path program 38 times [2020-02-10 19:34:49,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623297203] [2020-02-10 19:34:49,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:50,250 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-02-10 19:34:50,377 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:34:50,528 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:50,674 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:50,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623297203] [2020-02-10 19:34:50,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:50,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:50,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838312399] [2020-02-10 19:34:50,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:50,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:50,686 INFO L87 Difference]: Start difference. First operand 6217 states and 34137 transitions. Second operand 13 states. [2020-02-10 19:34:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:51,030 INFO L93 Difference]: Finished difference Result 11854 states and 58478 transitions. [2020-02-10 19:34:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:51,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:51,060 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 19:34:51,060 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:34:51,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:34:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6209. [2020-02-10 19:34:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:34:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34115 transitions. [2020-02-10 19:34:51,680 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34115 transitions. Word has length 34 [2020-02-10 19:34:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:51,680 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34115 transitions. [2020-02-10 19:34:51,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34115 transitions. [2020-02-10 19:34:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:51,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:51,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:51,691 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1303436242, now seen corresponding path program 39 times [2020-02-10 19:34:51,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:51,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308578697] [2020-02-10 19:34:51,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:52,224 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:34:52,373 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:52,514 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:52,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308578697] [2020-02-10 19:34:52,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:52,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:52,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306049566] [2020-02-10 19:34:52,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:52,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:52,527 INFO L87 Difference]: Start difference. First operand 6209 states and 34115 transitions. Second operand 13 states. [2020-02-10 19:34:53,045 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-02-10 19:34:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:53,071 INFO L93 Difference]: Finished difference Result 11841 states and 58453 transitions. [2020-02-10 19:34:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:53,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:53,113 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 19:34:53,113 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:34:53,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:34:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 19:34:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:34:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34126 transitions. [2020-02-10 19:34:53,892 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34126 transitions. Word has length 34 [2020-02-10 19:34:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:53,892 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34126 transitions. [2020-02-10 19:34:53,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34126 transitions. [2020-02-10 19:34:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:53,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:53,904 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1912086904, now seen corresponding path program 40 times [2020-02-10 19:34:53,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:53,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474757669] [2020-02-10 19:34:53,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:54,474 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:34:54,615 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:54,763 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:54,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474757669] [2020-02-10 19:34:54,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:54,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:54,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688393439] [2020-02-10 19:34:54,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:54,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:54,776 INFO L87 Difference]: Start difference. First operand 6215 states and 34126 transitions. Second operand 13 states. [2020-02-10 19:34:55,157 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-02-10 19:34:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:55,185 INFO L93 Difference]: Finished difference Result 11840 states and 58445 transitions. [2020-02-10 19:34:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:55,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:55,216 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 19:34:55,217 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 19:34:55,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 19:34:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6209. [2020-02-10 19:34:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:34:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34109 transitions. [2020-02-10 19:34:55,831 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34109 transitions. Word has length 34 [2020-02-10 19:34:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:55,831 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34109 transitions. [2020-02-10 19:34:55,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34109 transitions. [2020-02-10 19:34:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:55,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:55,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:55,843 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -6309138, now seen corresponding path program 41 times [2020-02-10 19:34:55,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:55,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629674024] [2020-02-10 19:34:55,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:56,566 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:34:56,711 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:56,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629674024] [2020-02-10 19:34:56,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:56,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:56,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788816610] [2020-02-10 19:34:56,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:56,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:56,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:56,723 INFO L87 Difference]: Start difference. First operand 6209 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:34:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:56,994 INFO L93 Difference]: Finished difference Result 11852 states and 58467 transitions. [2020-02-10 19:34:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:56,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:57,024 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 19:34:57,024 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 19:34:57,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 19:34:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 19:34:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:34:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34121 transitions. [2020-02-10 19:34:57,650 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34121 transitions. Word has length 34 [2020-02-10 19:34:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:57,650 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34121 transitions. [2020-02-10 19:34:57,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34121 transitions. [2020-02-10 19:34:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:57,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:57,662 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 267269468, now seen corresponding path program 42 times [2020-02-10 19:34:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51087686] [2020-02-10 19:34:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:58,377 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:58,527 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:34: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 19:34:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51087686] [2020-02-10 19:34:58,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:58,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:34:58,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113662793] [2020-02-10 19:34:58,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:34:58,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:34:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:58,539 INFO L87 Difference]: Start difference. First operand 6216 states and 34121 transitions. Second operand 13 states. [2020-02-10 19:34:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:58,865 INFO L93 Difference]: Finished difference Result 11846 states and 58449 transitions. [2020-02-10 19:34:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:34:58,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:34:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:58,894 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 19:34:58,894 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 19:34:58,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:34:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 19:34:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6202. [2020-02-10 19:34:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 19:34:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34089 transitions. [2020-02-10 19:34:59,610 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34089 transitions. Word has length 34 [2020-02-10 19:34:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:59,611 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34089 transitions. [2020-02-10 19:34:59,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:34:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34089 transitions. [2020-02-10 19:34:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:34:59,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:59,622 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash -455854420, now seen corresponding path program 43 times [2020-02-10 19:34:59,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:59,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426536210] [2020-02-10 19:34:59,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:00,332 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:00,481 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:00,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426536210] [2020-02-10 19:35:00,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:00,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:00,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744510436] [2020-02-10 19:35:00,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:00,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:00,493 INFO L87 Difference]: Start difference. First operand 6202 states and 34089 transitions. Second operand 13 states. [2020-02-10 19:35:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:00,844 INFO L93 Difference]: Finished difference Result 11836 states and 58443 transitions. [2020-02-10 19:35:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:00,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:00,874 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 19:35:00,875 INFO L226 Difference]: Without dead ends: 11817 [2020-02-10 19:35:00,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2020-02-10 19:35:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 6214. [2020-02-10 19:35:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:35:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34123 transitions. [2020-02-10 19:35:01,500 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34123 transitions. Word has length 34 [2020-02-10 19:35:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:01,501 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34123 transitions. [2020-02-10 19:35:01,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34123 transitions. [2020-02-10 19:35:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:01,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:01,512 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 152796242, now seen corresponding path program 44 times [2020-02-10 19:35:01,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:01,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280517210] [2020-02-10 19:35:01,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:02,089 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:35:02,231 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:02,378 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:02,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280517210] [2020-02-10 19:35:02,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:02,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:02,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485376605] [2020-02-10 19:35:02,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:02,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:02,391 INFO L87 Difference]: Start difference. First operand 6214 states and 34123 transitions. Second operand 13 states. [2020-02-10 19:35:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:02,714 INFO L93 Difference]: Finished difference Result 11835 states and 58435 transitions. [2020-02-10 19:35:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:02,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:02,747 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 19:35:02,747 INFO L226 Difference]: Without dead ends: 11811 [2020-02-10 19:35:02,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2020-02-10 19:35:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 6208. [2020-02-10 19:35:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:35:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34106 transitions. [2020-02-10 19:35:03,373 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34106 transitions. Word has length 34 [2020-02-10 19:35:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:03,373 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34106 transitions. [2020-02-10 19:35:03,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34106 transitions. [2020-02-10 19:35:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:03,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:03,384 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash -724600848, now seen corresponding path program 45 times [2020-02-10 19:35:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:03,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882539408] [2020-02-10 19:35:03,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:04,026 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 19:35:04,168 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:04,315 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:04,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882539408] [2020-02-10 19:35:04,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:04,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:04,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816570418] [2020-02-10 19:35:04,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:04,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:04,330 INFO L87 Difference]: Start difference. First operand 6208 states and 34106 transitions. Second operand 13 states. [2020-02-10 19:35:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:04,677 INFO L93 Difference]: Finished difference Result 11841 states and 58448 transitions. [2020-02-10 19:35:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:04,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:04,708 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 19:35:04,708 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:35:04,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:35:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 19:35:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:35:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34119 transitions. [2020-02-10 19:35:05,332 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34119 transitions. Word has length 34 [2020-02-10 19:35:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:05,332 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34119 transitions. [2020-02-10 19:35:05,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34119 transitions. [2020-02-10 19:35:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:05,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:05,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:05,343 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:05,344 INFO L82 PathProgramCache]: Analyzing trace with hash -933063602, now seen corresponding path program 46 times [2020-02-10 19:35:05,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:05,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186763650] [2020-02-10 19:35:05,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:06,037 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:06,192 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:06,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186763650] [2020-02-10 19:35:06,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:06,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:06,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275399354] [2020-02-10 19:35:06,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:06,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:06,204 INFO L87 Difference]: Start difference. First operand 6215 states and 34119 transitions. Second operand 13 states. [2020-02-10 19:35:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:06,609 INFO L93 Difference]: Finished difference Result 11844 states and 58447 transitions. [2020-02-10 19:35:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:06,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:06,639 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 19:35:06,639 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 19:35:06,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 19:35:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6208. [2020-02-10 19:35:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:35:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34100 transitions. [2020-02-10 19:35:07,257 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34100 transitions. Word has length 34 [2020-02-10 19:35:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:07,257 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34100 transitions. [2020-02-10 19:35:07,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34100 transitions. [2020-02-10 19:35:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:07,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:07,269 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash -136936970, now seen corresponding path program 47 times [2020-02-10 19:35:07,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:07,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707669807] [2020-02-10 19:35:07,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:07,941 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:08,097 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:08,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707669807] [2020-02-10 19:35:08,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:08,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:08,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731775014] [2020-02-10 19:35:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:08,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:08,109 INFO L87 Difference]: Start difference. First operand 6208 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:35:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:08,437 INFO L93 Difference]: Finished difference Result 11838 states and 58435 transitions. [2020-02-10 19:35:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:08,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:08,467 INFO L225 Difference]: With dead ends: 11838 [2020-02-10 19:35:08,467 INFO L226 Difference]: Without dead ends: 11820 [2020-02-10 19:35:08,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11820 states. [2020-02-10 19:35:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11820 to 6214. [2020-02-10 19:35:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:35:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34111 transitions. [2020-02-10 19:35:09,166 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34111 transitions. Word has length 34 [2020-02-10 19:35:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:09,166 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34111 transitions. [2020-02-10 19:35:09,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34111 transitions. [2020-02-10 19:35:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:09,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:09,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:09,178 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash 755237736, now seen corresponding path program 48 times [2020-02-10 19:35:09,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:09,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992885650] [2020-02-10 19:35:09,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:09,845 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:09,999 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:10,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992885650] [2020-02-10 19:35:10,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:10,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:10,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640624419] [2020-02-10 19:35:10,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:10,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:10,012 INFO L87 Difference]: Start difference. First operand 6214 states and 34111 transitions. Second operand 13 states. [2020-02-10 19:35:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:10,510 INFO L93 Difference]: Finished difference Result 11842 states and 58437 transitions. [2020-02-10 19:35:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:10,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:10,539 INFO L225 Difference]: With dead ends: 11842 [2020-02-10 19:35:10,539 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 19:35:10,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 19:35:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6194. [2020-02-10 19:35:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 19:35:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34068 transitions. [2020-02-10 19:35:11,161 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34068 transitions. Word has length 34 [2020-02-10 19:35:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:11,161 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34068 transitions. [2020-02-10 19:35:11,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34068 transitions. [2020-02-10 19:35:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:11,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:11,173 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -561652570, now seen corresponding path program 49 times [2020-02-10 19:35:11,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:11,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989380786] [2020-02-10 19:35:11,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:11,732 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:11,879 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:35:12,025 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:35:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:12,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989380786] [2020-02-10 19:35:12,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:12,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:12,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442768876] [2020-02-10 19:35:12,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:12,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:12,038 INFO L87 Difference]: Start difference. First operand 6194 states and 34068 transitions. Second operand 13 states. [2020-02-10 19:35:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:12,487 INFO L93 Difference]: Finished difference Result 11879 states and 58554 transitions. [2020-02-10 19:35:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:12,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:12,520 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 19:35:12,520 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 19:35:12,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 19:35:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6223. [2020-02-10 19:35:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:35:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34155 transitions. [2020-02-10 19:35:13,258 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34155 transitions. Word has length 34 [2020-02-10 19:35:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:13,258 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34155 transitions. [2020-02-10 19:35:13,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34155 transitions. [2020-02-10 19:35:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:13,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:13,270 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1198119424, now seen corresponding path program 50 times [2020-02-10 19:35:13,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:13,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158437245] [2020-02-10 19:35:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:13,811 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:13,955 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:14,105 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:14,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158437245] [2020-02-10 19:35:14,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:14,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:14,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179900596] [2020-02-10 19:35:14,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:14,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:14,118 INFO L87 Difference]: Start difference. First operand 6223 states and 34155 transitions. Second operand 13 states. [2020-02-10 19:35:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:14,461 INFO L93 Difference]: Finished difference Result 11877 states and 58540 transitions. [2020-02-10 19:35:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:14,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:14,491 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 19:35:14,491 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 19:35:14,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 19:35:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 19:35:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:35:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34126 transitions. [2020-02-10 19:35:15,112 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34126 transitions. Word has length 34 [2020-02-10 19:35:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:15,112 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34126 transitions. [2020-02-10 19:35:15,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34126 transitions. [2020-02-10 19:35:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:15,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:15,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:15,124 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash 239190494, now seen corresponding path program 51 times [2020-02-10 19:35:15,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:15,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752573651] [2020-02-10 19:35:15,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:15,803 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:35:15,955 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:35:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:15,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752573651] [2020-02-10 19:35:15,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:15,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:15,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920578793] [2020-02-10 19:35:15,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:15,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:15,967 INFO L87 Difference]: Start difference. First operand 6211 states and 34126 transitions. Second operand 13 states. [2020-02-10 19:35:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:16,207 INFO L93 Difference]: Finished difference Result 11870 states and 58525 transitions. [2020-02-10 19:35:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:16,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:16,237 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 19:35:16,237 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 19:35:16,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 19:35:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6218. [2020-02-10 19:35:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:35:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34138 transitions. [2020-02-10 19:35:16,856 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34138 transitions. Word has length 34 [2020-02-10 19:35:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:16,856 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34138 transitions. [2020-02-10 19:35:16,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34138 transitions. [2020-02-10 19:35:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:16,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:16,868 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 27034876, now seen corresponding path program 52 times [2020-02-10 19:35:16,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:16,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433925257] [2020-02-10 19:35:16,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:17,556 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:35:17,703 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:35:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:17,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433925257] [2020-02-10 19:35:17,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:17,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:17,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405548685] [2020-02-10 19:35:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:17,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:17,715 INFO L87 Difference]: Start difference. First operand 6218 states and 34138 transitions. Second operand 13 states. [2020-02-10 19:35:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:18,070 INFO L93 Difference]: Finished difference Result 11864 states and 58507 transitions. [2020-02-10 19:35:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:18,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:18,103 INFO L225 Difference]: With dead ends: 11864 [2020-02-10 19:35:18,103 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 19:35:18,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 19:35:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6211. [2020-02-10 19:35:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:35:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34119 transitions. [2020-02-10 19:35:18,726 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34119 transitions. Word has length 34 [2020-02-10 19:35:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:18,727 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34119 transitions. [2020-02-10 19:35:18,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34119 transitions. [2020-02-10 19:35:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:18,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:18,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:18,737 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1771398882, now seen corresponding path program 53 times [2020-02-10 19:35:18,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:18,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215941425] [2020-02-10 19:35:18,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:19,412 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:19,564 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:19,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215941425] [2020-02-10 19:35:19,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:19,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:19,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756839280] [2020-02-10 19:35:19,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:19,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:19,575 INFO L87 Difference]: Start difference. First operand 6211 states and 34119 transitions. Second operand 13 states. [2020-02-10 19:35:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:19,860 INFO L93 Difference]: Finished difference Result 11861 states and 58502 transitions. [2020-02-10 19:35:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:19,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:19,890 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 19:35:19,890 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 19:35:19,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 19:35:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6217. [2020-02-10 19:35:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:35:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 19:35:20,512 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 19:35:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:20,513 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 19:35:20,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 19:35:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:20,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:20,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:20,524 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1347087646, now seen corresponding path program 54 times [2020-02-10 19:35:20,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:20,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222153761] [2020-02-10 19:35:20,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:21,214 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:21,364 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:21,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222153761] [2020-02-10 19:35:21,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:21,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:21,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061724588] [2020-02-10 19:35:21,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:21,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:21,378 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 19:35:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:21,782 INFO L93 Difference]: Finished difference Result 11865 states and 58504 transitions. [2020-02-10 19:35:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:21,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:21,813 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 19:35:21,813 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 19:35:21,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 19:35:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6203. [2020-02-10 19:35:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 19:35:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34098 transitions. [2020-02-10 19:35:22,523 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34098 transitions. Word has length 34 [2020-02-10 19:35:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:22,523 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34098 transitions. [2020-02-10 19:35:22,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34098 transitions. [2020-02-10 19:35:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:22,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:22,535 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 165542264, now seen corresponding path program 55 times [2020-02-10 19:35:22,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:22,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8155591] [2020-02-10 19:35:22,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:23,100 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:23,249 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:35:23,396 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:35:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:23,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8155591] [2020-02-10 19:35:23,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:23,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:23,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40695598] [2020-02-10 19:35:23,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:23,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:23,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:23,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:23,409 INFO L87 Difference]: Start difference. First operand 6203 states and 34098 transitions. Second operand 13 states. [2020-02-10 19:35:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:23,670 INFO L93 Difference]: Finished difference Result 11892 states and 58583 transitions. [2020-02-10 19:35:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:23,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:23,701 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 19:35:23,701 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 19:35:23,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 19:35:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6227. [2020-02-10 19:35:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 19:35:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34160 transitions. [2020-02-10 19:35:24,319 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34160 transitions. Word has length 34 [2020-02-10 19:35:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:24,320 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34160 transitions. [2020-02-10 19:35:24,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34160 transitions. [2020-02-10 19:35:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:24,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:24,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:24,331 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash -470924590, now seen corresponding path program 56 times [2020-02-10 19:35:24,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:24,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146207281] [2020-02-10 19:35:24,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:24,906 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:25,048 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:25,190 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:25,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146207281] [2020-02-10 19:35:25,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:25,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:25,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846845443] [2020-02-10 19:35:25,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:25,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:25,203 INFO L87 Difference]: Start difference. First operand 6227 states and 34160 transitions. Second operand 13 states. [2020-02-10 19:35:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:25,509 INFO L93 Difference]: Finished difference Result 11890 states and 58569 transitions. [2020-02-10 19:35:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:25,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:25,538 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 19:35:25,538 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 19:35:25,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 19:35:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6215. [2020-02-10 19:35:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:35:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34128 transitions. [2020-02-10 19:35:26,158 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34128 transitions. Word has length 34 [2020-02-10 19:35:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:26,159 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34128 transitions. [2020-02-10 19:35:26,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34128 transitions. [2020-02-10 19:35:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:26,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:26,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:26,170 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:26,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1093561694, now seen corresponding path program 57 times [2020-02-10 19:35:26,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:26,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704580167] [2020-02-10 19:35:26,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:26,717 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:26,866 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:35:27,113 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:27,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704580167] [2020-02-10 19:35:27,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:27,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:27,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504011649] [2020-02-10 19:35:27,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:27,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:27,126 INFO L87 Difference]: Start difference. First operand 6215 states and 34128 transitions. Second operand 13 states. [2020-02-10 19:35:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:27,422 INFO L93 Difference]: Finished difference Result 11889 states and 58566 transitions. [2020-02-10 19:35:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:27,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:27,454 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 19:35:27,454 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 19:35:27,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 19:35:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6225. [2020-02-10 19:35:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:35:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34146 transitions. [2020-02-10 19:35:28,073 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34146 transitions. Word has length 34 [2020-02-10 19:35:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:28,073 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34146 transitions. [2020-02-10 19:35:28,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34146 transitions. [2020-02-10 19:35:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:28,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:28,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:28,084 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -603683250, now seen corresponding path program 58 times [2020-02-10 19:35:28,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:28,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606701312] [2020-02-10 19:35:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:28,634 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:28,777 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:28,926 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:28,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606701312] [2020-02-10 19:35:28,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:28,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:28,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358650902] [2020-02-10 19:35:28,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:28,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:28,938 INFO L87 Difference]: Start difference. First operand 6225 states and 34146 transitions. Second operand 13 states. [2020-02-10 19:35:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:29,244 INFO L93 Difference]: Finished difference Result 11886 states and 58551 transitions. [2020-02-10 19:35:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:29,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:29,274 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 19:35:29,274 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 19:35:29,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 19:35:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6215. [2020-02-10 19:35:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:35:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34118 transitions. [2020-02-10 19:35:29,901 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34118 transitions. Word has length 34 [2020-02-10 19:35:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:29,901 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34118 transitions. [2020-02-10 19:35:29,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34118 transitions. [2020-02-10 19:35:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:29,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:29,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:29,912 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2093508450, now seen corresponding path program 59 times [2020-02-10 19:35:29,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:29,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088837067] [2020-02-10 19:35:29,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:30,459 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:30,604 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:30,753 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:30,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088837067] [2020-02-10 19:35:30,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:30,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:30,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065772148] [2020-02-10 19:35:30,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:30,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:30,766 INFO L87 Difference]: Start difference. First operand 6215 states and 34118 transitions. Second operand 13 states. [2020-02-10 19:35:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:31,192 INFO L93 Difference]: Finished difference Result 11884 states and 58548 transitions. [2020-02-10 19:35:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:31,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:31,222 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:35:31,222 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 19:35:31,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 19:35:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6224. [2020-02-10 19:35:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 19:35:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34135 transitions. [2020-02-10 19:35:31,926 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34135 transitions. Word has length 34 [2020-02-10 19:35:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:31,926 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34135 transitions. [2020-02-10 19:35:31,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34135 transitions. [2020-02-10 19:35:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:31,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:31,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:31,938 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1140680756, now seen corresponding path program 60 times [2020-02-10 19:35:31,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:31,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147250213] [2020-02-10 19:35:31,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:32,480 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:32,643 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:35:32,794 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:35:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:32,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147250213] [2020-02-10 19:35:32,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:32,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:32,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107799789] [2020-02-10 19:35:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:32,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:32,807 INFO L87 Difference]: Start difference. First operand 6224 states and 34135 transitions. Second operand 13 states. [2020-02-10 19:35:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:33,124 INFO L93 Difference]: Finished difference Result 11883 states and 58537 transitions. [2020-02-10 19:35:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:33,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:33,153 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 19:35:33,153 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 19:35:33,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 19:35:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6203. [2020-02-10 19:35:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 19:35:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34089 transitions. [2020-02-10 19:35:33,782 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34089 transitions. Word has length 34 [2020-02-10 19:35:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:33,782 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34089 transitions. [2020-02-10 19:35:33,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34089 transitions. [2020-02-10 19:35:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:33,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:33,793 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1056978248, now seen corresponding path program 61 times [2020-02-10 19:35:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145826483] [2020-02-10 19:35:33,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:34,475 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:35:34,625 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:34,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145826483] [2020-02-10 19:35:34,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:34,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:34,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052720642] [2020-02-10 19:35:34,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:34,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:34,638 INFO L87 Difference]: Start difference. First operand 6203 states and 34089 transitions. Second operand 13 states. [2020-02-10 19:35:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:34,901 INFO L93 Difference]: Finished difference Result 11866 states and 58508 transitions. [2020-02-10 19:35:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:34,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:34,930 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 19:35:34,930 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 19:35:34,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 19:35:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6217. [2020-02-10 19:35:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:35:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34127 transitions. [2020-02-10 19:35:35,553 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34127 transitions. Word has length 34 [2020-02-10 19:35:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:35,553 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34127 transitions. [2020-02-10 19:35:35,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34127 transitions. [2020-02-10 19:35:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:35,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:35,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:35,564 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1269133866, now seen corresponding path program 62 times [2020-02-10 19:35:35,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:35,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401146202] [2020-02-10 19:35:35,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:36,419 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:36,565 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:36,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401146202] [2020-02-10 19:35:36,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:36,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:36,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324044110] [2020-02-10 19:35:36,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:36,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:36,578 INFO L87 Difference]: Start difference. First operand 6217 states and 34127 transitions. Second operand 13 states. [2020-02-10 19:35:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:36,872 INFO L93 Difference]: Finished difference Result 11860 states and 58490 transitions. [2020-02-10 19:35:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:36,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:36,903 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 19:35:36,903 INFO L226 Difference]: Without dead ends: 11835 [2020-02-10 19:35:36,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2020-02-10 19:35:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 6210. [2020-02-10 19:35:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:35:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34108 transitions. [2020-02-10 19:35:37,529 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34108 transitions. Word has length 34 [2020-02-10 19:35:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:37,529 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34108 transitions. [2020-02-10 19:35:37,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34108 transitions. [2020-02-10 19:35:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:37,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:37,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:37,541 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 149892902, now seen corresponding path program 63 times [2020-02-10 19:35:37,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:37,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991473149] [2020-02-10 19:35:37,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:37,977 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 19:35:38,249 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:35:38,395 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:38,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991473149] [2020-02-10 19:35:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:38,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:38,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472560509] [2020-02-10 19:35:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:38,407 INFO L87 Difference]: Start difference. First operand 6210 states and 34108 transitions. Second operand 13 states. [2020-02-10 19:35:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:38,712 INFO L93 Difference]: Finished difference Result 11872 states and 58516 transitions. [2020-02-10 19:35:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:38,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:38,741 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 19:35:38,741 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 19:35:38,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 19:35:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6220. [2020-02-10 19:35:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:35:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34126 transitions. [2020-02-10 19:35:39,359 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34126 transitions. Word has length 34 [2020-02-10 19:35:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:39,359 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34126 transitions. [2020-02-10 19:35:39,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34126 transitions. [2020-02-10 19:35:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:39,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:39,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:39,370 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1547352042, now seen corresponding path program 64 times [2020-02-10 19:35:39,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:39,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589483921] [2020-02-10 19:35:39,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:40,041 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:40,187 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:40,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589483921] [2020-02-10 19:35:40,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:40,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:40,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109142142] [2020-02-10 19:35:40,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:40,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:40,199 INFO L87 Difference]: Start difference. First operand 6220 states and 34126 transitions. Second operand 13 states. [2020-02-10 19:35:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:40,543 INFO L93 Difference]: Finished difference Result 11869 states and 58501 transitions. [2020-02-10 19:35:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:40,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:40,572 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 19:35:40,573 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 19:35:40,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 19:35:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6210. [2020-02-10 19:35:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:35:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34101 transitions. [2020-02-10 19:35:41,283 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34101 transitions. Word has length 34 [2020-02-10 19:35:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:41,283 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34101 transitions. [2020-02-10 19:35:41,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34101 transitions. [2020-02-10 19:35:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:41,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:41,294 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:41,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1950847718, now seen corresponding path program 65 times [2020-02-10 19:35:41,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:41,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892324712] [2020-02-10 19:35:41,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:41,956 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:42,106 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:42,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892324712] [2020-02-10 19:35:42,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:42,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:42,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218589091] [2020-02-10 19:35:42,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:42,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:42,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:42,119 INFO L87 Difference]: Start difference. First operand 6210 states and 34101 transitions. Second operand 13 states. [2020-02-10 19:35:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:42,455 INFO L93 Difference]: Finished difference Result 11856 states and 58476 transitions. [2020-02-10 19:35:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:42,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:42,485 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 19:35:42,485 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 19:35:42,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 19:35:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6216. [2020-02-10 19:35:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:35:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34112 transitions. [2020-02-10 19:35:43,106 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34112 transitions. Word has length 34 [2020-02-10 19:35:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:43,106 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34112 transitions. [2020-02-10 19:35:43,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34112 transitions. [2020-02-10 19:35:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:43,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:43,118 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 465758392, now seen corresponding path program 66 times [2020-02-10 19:35:43,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:43,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441245524] [2020-02-10 19:35:43,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:43,777 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:43,922 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:43,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441245524] [2020-02-10 19:35:43,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:43,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:43,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117028292] [2020-02-10 19:35:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:43,934 INFO L87 Difference]: Start difference. First operand 6216 states and 34112 transitions. Second operand 13 states. [2020-02-10 19:35:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:44,305 INFO L93 Difference]: Finished difference Result 11859 states and 58476 transitions. [2020-02-10 19:35:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:44,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:44,334 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 19:35:44,334 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 19:35:44,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 19:35:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6203. [2020-02-10 19:35:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 19:35:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34082 transitions. [2020-02-10 19:35:44,960 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34082 transitions. Word has length 34 [2020-02-10 19:35:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:44,960 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34082 transitions. [2020-02-10 19:35:44,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34082 transitions. [2020-02-10 19:35:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:44,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:44,971 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1284060522, now seen corresponding path program 67 times [2020-02-10 19:35:44,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:44,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320374742] [2020-02-10 19:35:44,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:45,808 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:35:45,958 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:45,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320374742] [2020-02-10 19:35:45,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:45,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:45,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733005097] [2020-02-10 19:35:45,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:45,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:45,971 INFO L87 Difference]: Start difference. First operand 6203 states and 34082 transitions. Second operand 13 states. [2020-02-10 19:35:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:46,304 INFO L93 Difference]: Finished difference Result 11852 states and 58475 transitions. [2020-02-10 19:35:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:46,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:46,333 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 19:35:46,333 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 19:35:46,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 19:35:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6215. [2020-02-10 19:35:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:35:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34116 transitions. [2020-02-10 19:35:46,953 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34116 transitions. Word has length 34 [2020-02-10 19:35:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:46,954 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34116 transitions. [2020-02-10 19:35:46,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34116 transitions. [2020-02-10 19:35:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:46,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:46,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:46,965 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1708371758, now seen corresponding path program 68 times [2020-02-10 19:35:46,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:46,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231297999] [2020-02-10 19:35:46,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:47,684 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:47,837 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:47,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231297999] [2020-02-10 19:35:47,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:47,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:47,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691516046] [2020-02-10 19:35:47,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:47,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:47,849 INFO L87 Difference]: Start difference. First operand 6215 states and 34116 transitions. Second operand 13 states. [2020-02-10 19:35:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:48,189 INFO L93 Difference]: Finished difference Result 11856 states and 58477 transitions. [2020-02-10 19:35:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:48,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:48,219 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 19:35:48,219 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 19:35:48,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 19:35:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6209. [2020-02-10 19:35:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:35:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34099 transitions. [2020-02-10 19:35:48,845 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34099 transitions. Word has length 34 [2020-02-10 19:35:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:48,845 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34099 transitions. [2020-02-10 19:35:48,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34099 transitions. [2020-02-10 19:35:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:48,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:48,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:48,857 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 191557056, now seen corresponding path program 69 times [2020-02-10 19:35:48,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:48,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908560450] [2020-02-10 19:35:48,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:49,516 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:35:49,665 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:35:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:49,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908560450] [2020-02-10 19:35:49,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:49,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:49,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260525322] [2020-02-10 19:35:49,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:49,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:49,678 INFO L87 Difference]: Start difference. First operand 6209 states and 34099 transitions. Second operand 13 states. [2020-02-10 19:35:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:50,061 INFO L93 Difference]: Finished difference Result 11851 states and 58467 transitions. [2020-02-10 19:35:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:50,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:50,091 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 19:35:50,091 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 19:35:50,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 19:35:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6215. [2020-02-10 19:35:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:35:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 19:35:50,793 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 19:35:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:50,793 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 19:35:50,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 19:35:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:50,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:50,805 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1293532270, now seen corresponding path program 70 times [2020-02-10 19:35:50,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:50,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230966231] [2020-02-10 19:35:50,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:51,470 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:35:51,627 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:35:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:51,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230966231] [2020-02-10 19:35:51,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:51,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:51,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213711681] [2020-02-10 19:35:51,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:51,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:51,642 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:35:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:52,124 INFO L93 Difference]: Finished difference Result 11854 states and 58467 transitions. [2020-02-10 19:35:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:52,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:52,155 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 19:35:52,155 INFO L226 Difference]: Without dead ends: 11827 [2020-02-10 19:35:52,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11827 states. [2020-02-10 19:35:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11827 to 6209. [2020-02-10 19:35:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:35:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34093 transitions. [2020-02-10 19:35:52,776 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34093 transitions. Word has length 34 [2020-02-10 19:35:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:52,776 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34093 transitions. [2020-02-10 19:35:52,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34093 transitions. [2020-02-10 19:35:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:52,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:52,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:52,788 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash -501500608, now seen corresponding path program 71 times [2020-02-10 19:35:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:52,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073832807] [2020-02-10 19:35:52,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:53,330 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:53,473 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:53,621 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:35:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:53,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073832807] [2020-02-10 19:35:53,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:53,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:53,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845499020] [2020-02-10 19:35:53,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:53,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:53,633 INFO L87 Difference]: Start difference. First operand 6209 states and 34093 transitions. Second operand 13 states. [2020-02-10 19:35:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:54,101 INFO L93 Difference]: Finished difference Result 11862 states and 58486 transitions. [2020-02-10 19:35:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:54,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:54,140 INFO L225 Difference]: With dead ends: 11862 [2020-02-10 19:35:54,140 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 19:35:54,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 19:35:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6218. [2020-02-10 19:35:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:35:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 19:35:54,759 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 19:35:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:54,759 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 19:35:54,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 19:35:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:54,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:54,770 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1562278698, now seen corresponding path program 72 times [2020-02-10 19:35:54,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:54,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949751618] [2020-02-10 19:35:54,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:55,419 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:55,562 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:35:55,714 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:35:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:55,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949751618] [2020-02-10 19:35:55,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:55,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:55,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579527534] [2020-02-10 19:35:55,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:55,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:55,726 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:35:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:56,076 INFO L93 Difference]: Finished difference Result 11861 states and 58475 transitions. [2020-02-10 19:35:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:56,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:56,115 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 19:35:56,115 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 19:35:56,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 19:35:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6194. [2020-02-10 19:35:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 19:35:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34059 transitions. [2020-02-10 19:35:56,747 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34059 transitions. Word has length 34 [2020-02-10 19:35:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:56,748 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34059 transitions. [2020-02-10 19:35:56,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34059 transitions. [2020-02-10 19:35:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:56,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:56,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:56,759 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2058767766, now seen corresponding path program 73 times [2020-02-10 19:35:56,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:56,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494076390] [2020-02-10 19:35:56,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:57,306 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:35:57,450 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:35:57,597 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:57,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494076390] [2020-02-10 19:35:57,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:57,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:57,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835614350] [2020-02-10 19:35:57,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:57,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:57,610 INFO L87 Difference]: Start difference. First operand 6194 states and 34059 transitions. Second operand 13 states. [2020-02-10 19:35:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:57,896 INFO L93 Difference]: Finished difference Result 11843 states and 58462 transitions. [2020-02-10 19:35:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:57,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:57,926 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 19:35:57,926 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 19:35:57,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:35:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 19:35:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6216. [2020-02-10 19:35:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:35:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 19:35:58,550 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 19:35:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:58,550 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 19:35:58,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:35:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 19:35:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:35:58,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:58,561 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1073831482, now seen corresponding path program 74 times [2020-02-10 19:35:58,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:58,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067349335] [2020-02-10 19:35:58,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:59,098 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:35:59,248 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:35:59,396 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:35:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:59,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067349335] [2020-02-10 19:35:59,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:59,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:35:59,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781855001] [2020-02-10 19:35:59,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:35:59,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:59,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:35:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:59,409 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 19:35:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:59,652 INFO L93 Difference]: Finished difference Result 11848 states and 58464 transitions. [2020-02-10 19:35:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:35:59,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:35:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:59,681 INFO L225 Difference]: With dead ends: 11848 [2020-02-10 19:35:59,681 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 19:35:59,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 19:36:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6208. [2020-02-10 19:36:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:36:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34111 transitions. [2020-02-10 19:36:00,392 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34111 transitions. Word has length 34 [2020-02-10 19:36:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:00,392 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34111 transitions. [2020-02-10 19:36:00,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34111 transitions. [2020-02-10 19:36:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:00,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:00,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:00,403 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash -223089096, now seen corresponding path program 75 times [2020-02-10 19:36:00,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:00,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314645861] [2020-02-10 19:36:00,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:00,952 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:01,102 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:01,256 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:01,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314645861] [2020-02-10 19:36:01,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:01,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:01,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773303599] [2020-02-10 19:36:01,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:01,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:01,268 INFO L87 Difference]: Start difference. First operand 6208 states and 34111 transitions. Second operand 13 states. [2020-02-10 19:36:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:01,654 INFO L93 Difference]: Finished difference Result 11835 states and 58439 transitions. [2020-02-10 19:36:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:01,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:01,684 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 19:36:01,685 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 19:36:01,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 19:36:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6214. [2020-02-10 19:36:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:36:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34122 transitions. [2020-02-10 19:36:02,304 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34122 transitions. Word has length 34 [2020-02-10 19:36:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:02,305 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34122 transitions. [2020-02-10 19:36:02,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34122 transitions. [2020-02-10 19:36:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:02,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:02,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:02,317 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:02,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash 385561566, now seen corresponding path program 76 times [2020-02-10 19:36:02,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:02,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300799180] [2020-02-10 19:36:02,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:03,005 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:03,156 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:03,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300799180] [2020-02-10 19:36:03,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:03,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43860663] [2020-02-10 19:36:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:03,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:03,168 INFO L87 Difference]: Start difference. First operand 6214 states and 34122 transitions. Second operand 13 states. [2020-02-10 19:36:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:03,475 INFO L93 Difference]: Finished difference Result 11834 states and 58431 transitions. [2020-02-10 19:36:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:03,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:03,505 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 19:36:03,505 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 19:36:03,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 19:36:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6208. [2020-02-10 19:36:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:36:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34105 transitions. [2020-02-10 19:36:04,123 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34105 transitions. Word has length 34 [2020-02-10 19:36:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:04,124 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34105 transitions. [2020-02-10 19:36:04,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34105 transitions. [2020-02-10 19:36:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:04,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:04,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:04,135 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1532834476, now seen corresponding path program 77 times [2020-02-10 19:36:04,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:04,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960768624] [2020-02-10 19:36:04,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:04,812 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:36:04,962 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:05,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960768624] [2020-02-10 19:36:05,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:05,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145432377] [2020-02-10 19:36:05,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:05,070 INFO L87 Difference]: Start difference. First operand 6208 states and 34105 transitions. Second operand 13 states. [2020-02-10 19:36:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:05,416 INFO L93 Difference]: Finished difference Result 11846 states and 58453 transitions. [2020-02-10 19:36:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:05,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:05,447 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 19:36:05,448 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:36:05,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:36:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 19:36:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:36:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34117 transitions. [2020-02-10 19:36:06,066 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34117 transitions. Word has length 34 [2020-02-10 19:36:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:06,067 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34117 transitions. [2020-02-10 19:36:06,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34117 transitions. [2020-02-10 19:36:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:06,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:06,078 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1259255870, now seen corresponding path program 78 times [2020-02-10 19:36:06,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:06,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476531689] [2020-02-10 19:36:06,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:06,763 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:06,911 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:06,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476531689] [2020-02-10 19:36:06,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:06,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:06,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109062013] [2020-02-10 19:36:06,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:06,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:06,923 INFO L87 Difference]: Start difference. First operand 6215 states and 34117 transitions. Second operand 13 states. [2020-02-10 19:36:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:07,267 INFO L93 Difference]: Finished difference Result 11840 states and 58435 transitions. [2020-02-10 19:36:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:07,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:07,298 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 19:36:07,299 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 19:36:07,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 19:36:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6201. [2020-02-10 19:36:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 19:36:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34085 transitions. [2020-02-10 19:36:07,920 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34085 transitions. Word has length 34 [2020-02-10 19:36:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:07,920 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34085 transitions. [2020-02-10 19:36:07,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34085 transitions. [2020-02-10 19:36:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:07,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:07,931 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:07,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash 817067752, now seen corresponding path program 79 times [2020-02-10 19:36:07,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:07,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097216958] [2020-02-10 19:36:07,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:08,468 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:36:08,607 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:08,755 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:08,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097216958] [2020-02-10 19:36:08,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:08,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:08,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120048527] [2020-02-10 19:36:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:08,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:08,768 INFO L87 Difference]: Start difference. First operand 6201 states and 34085 transitions. Second operand 13 states. [2020-02-10 19:36:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:09,095 INFO L93 Difference]: Finished difference Result 11851 states and 58477 transitions. [2020-02-10 19:36:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:09,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:09,124 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 19:36:09,124 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 19:36:09,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 19:36:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6217. [2020-02-10 19:36:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:36:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 19:36:09,839 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 19:36:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:09,839 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 19:36:09,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 19:36:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:09,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:09,850 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -167868532, now seen corresponding path program 80 times [2020-02-10 19:36:09,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:09,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550436713] [2020-02-10 19:36:09,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:10,383 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:36:10,534 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:36:10,683 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:10,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550436713] [2020-02-10 19:36:10,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:10,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:10,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983261308] [2020-02-10 19:36:10,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:10,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:10,695 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 19:36:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:11,058 INFO L93 Difference]: Finished difference Result 11856 states and 58479 transitions. [2020-02-10 19:36:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:11,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:11,089 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 19:36:11,089 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 19:36:11,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 19:36:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6209. [2020-02-10 19:36:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:36:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34107 transitions. [2020-02-10 19:36:11,708 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34107 transitions. Word has length 34 [2020-02-10 19:36:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:11,709 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34107 transitions. [2020-02-10 19:36:11,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34107 transitions. [2020-02-10 19:36:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:11,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:11,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:11,721 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash -257917960, now seen corresponding path program 81 times [2020-02-10 19:36:11,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:11,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754608506] [2020-02-10 19:36:11,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:12,394 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:12,539 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:12,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754608506] [2020-02-10 19:36:12,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:12,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:12,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075366455] [2020-02-10 19:36:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:12,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:12,551 INFO L87 Difference]: Start difference. First operand 6209 states and 34107 transitions. Second operand 13 states. [2020-02-10 19:36:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:12,993 INFO L93 Difference]: Finished difference Result 11847 states and 58462 transitions. [2020-02-10 19:36:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:12,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:13,022 INFO L225 Difference]: With dead ends: 11847 [2020-02-10 19:36:13,022 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 19:36:13,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 19:36:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 19:36:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:36:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34120 transitions. [2020-02-10 19:36:13,638 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34120 transitions. Word has length 34 [2020-02-10 19:36:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:13,639 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34120 transitions. [2020-02-10 19:36:13,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34120 transitions. [2020-02-10 19:36:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:13,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:13,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:13,650 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1158242348, now seen corresponding path program 82 times [2020-02-10 19:36:13,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:13,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711630474] [2020-02-10 19:36:13,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:14,321 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:14,468 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:14,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711630474] [2020-02-10 19:36:14,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:14,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:14,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332082090] [2020-02-10 19:36:14,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:14,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:14,480 INFO L87 Difference]: Start difference. First operand 6216 states and 34120 transitions. Second operand 13 states. [2020-02-10 19:36:14,861 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 19:36:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:14,890 INFO L93 Difference]: Finished difference Result 11849 states and 58459 transitions. [2020-02-10 19:36:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:14,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:14,921 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 19:36:14,922 INFO L226 Difference]: Without dead ends: 11821 [2020-02-10 19:36:14,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-02-10 19:36:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 6209. [2020-02-10 19:36:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:36:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34100 transitions. [2020-02-10 19:36:15,536 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34100 transitions. Word has length 34 [2020-02-10 19:36:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:15,536 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34100 transitions. [2020-02-10 19:36:15,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34100 transitions. [2020-02-10 19:36:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:15,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:15,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:15,547 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash 783428056, now seen corresponding path program 83 times [2020-02-10 19:36:15,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:15,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457596214] [2020-02-10 19:36:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:16,078 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:16,226 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:36:16,374 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:16,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457596214] [2020-02-10 19:36:16,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:16,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:16,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112338059] [2020-02-10 19:36:16,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:16,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:16,386 INFO L87 Difference]: Start difference. First operand 6209 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:36:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:16,673 INFO L93 Difference]: Finished difference Result 11860 states and 58481 transitions. [2020-02-10 19:36:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:16,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:16,702 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 19:36:16,703 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 19:36:16,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 19:36:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6219. [2020-02-10 19:36:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:36:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34118 transitions. [2020-02-10 19:36:17,327 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34118 transitions. Word has length 34 [2020-02-10 19:36:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:17,327 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34118 transitions. [2020-02-10 19:36:17,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34118 transitions. [2020-02-10 19:36:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:17,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:17,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:17,338 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash -469787928, now seen corresponding path program 84 times [2020-02-10 19:36:17,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:17,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139216053] [2020-02-10 19:36:17,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:17,893 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:18,034 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:18,183 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:18,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139216053] [2020-02-10 19:36:18,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:18,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:18,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663240033] [2020-02-10 19:36:18,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:18,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:18,195 INFO L87 Difference]: Start difference. First operand 6219 states and 34118 transitions. Second operand 13 states. [2020-02-10 19:36:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:18,485 INFO L93 Difference]: Finished difference Result 11857 states and 58466 transitions. [2020-02-10 19:36:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:18,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:18,515 INFO L225 Difference]: With dead ends: 11857 [2020-02-10 19:36:18,515 INFO L226 Difference]: Without dead ends: 11818 [2020-02-10 19:36:18,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11818 states. [2020-02-10 19:36:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11818 to 6201. [2020-02-10 19:36:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 19:36:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34078 transitions. [2020-02-10 19:36:19,134 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34078 transitions. Word has length 34 [2020-02-10 19:36:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:19,134 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34078 transitions. [2020-02-10 19:36:19,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34078 transitions. [2020-02-10 19:36:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:19,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:19,145 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 812092200, now seen corresponding path program 85 times [2020-02-10 19:36:19,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:19,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634694628] [2020-02-10 19:36:19,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:19,349 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-02-10 19:36:19,774 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:19,914 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:20,063 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:20,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 19:36:20,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634694628] [2020-02-10 19:36:20,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:20,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:20,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510064802] [2020-02-10 19:36:20,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:20,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:20,076 INFO L87 Difference]: Start difference. First operand 6201 states and 34078 transitions. Second operand 13 states. [2020-02-10 19:36:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:20,402 INFO L93 Difference]: Finished difference Result 11829 states and 58420 transitions. [2020-02-10 19:36:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:20,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:20,432 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 19:36:20,432 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 19:36:20,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 19:36:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6213. [2020-02-10 19:36:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:36:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34112 transitions. [2020-02-10 19:36:21,056 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34112 transitions. Word has length 34 [2020-02-10 19:36:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:21,056 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34112 transitions. [2020-02-10 19:36:21,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34112 transitions. [2020-02-10 19:36:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:21,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:21,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:21,067 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742862, now seen corresponding path program 86 times [2020-02-10 19:36:21,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:21,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201246899] [2020-02-10 19:36:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:21,600 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:21,746 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:21,896 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:21,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201246899] [2020-02-10 19:36:21,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:21,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:21,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755318257] [2020-02-10 19:36:21,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:21,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:21,909 INFO L87 Difference]: Start difference. First operand 6213 states and 34112 transitions. Second operand 13 states. [2020-02-10 19:36:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:22,205 INFO L93 Difference]: Finished difference Result 11828 states and 58412 transitions. [2020-02-10 19:36:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:22,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:22,235 INFO L225 Difference]: With dead ends: 11828 [2020-02-10 19:36:22,235 INFO L226 Difference]: Without dead ends: 11804 [2020-02-10 19:36:22,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2020-02-10 19:36:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 6207. [2020-02-10 19:36:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:36:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34095 transitions. [2020-02-10 19:36:22,849 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34095 transitions. Word has length 34 [2020-02-10 19:36:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:22,850 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34095 transitions. [2020-02-10 19:36:22,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34095 transitions. [2020-02-10 19:36:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:22,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:22,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:22,861 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2018963350, now seen corresponding path program 87 times [2020-02-10 19:36:22,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:22,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159197568] [2020-02-10 19:36:22,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:23,535 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:23,681 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:23,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159197568] [2020-02-10 19:36:23,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:23,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:23,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622845287] [2020-02-10 19:36:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:23,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:23,693 INFO L87 Difference]: Start difference. First operand 6207 states and 34095 transitions. Second operand 13 states. [2020-02-10 19:36:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:24,005 INFO L93 Difference]: Finished difference Result 11833 states and 58423 transitions. [2020-02-10 19:36:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:24,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:24,035 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 19:36:24,035 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 19:36:24,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 19:36:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 19:36:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:36:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34108 transitions. [2020-02-10 19:36:24,740 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34108 transitions. Word has length 34 [2020-02-10 19:36:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:24,740 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34108 transitions. [2020-02-10 19:36:24,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34108 transitions. [2020-02-10 19:36:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:24,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:24,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:24,751 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -859843638, now seen corresponding path program 88 times [2020-02-10 19:36:24,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:24,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647617977] [2020-02-10 19:36:24,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:25,421 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:25,566 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:25,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647617977] [2020-02-10 19:36:25,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:25,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:25,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522502517] [2020-02-10 19:36:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:25,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:25,579 INFO L87 Difference]: Start difference. First operand 6214 states and 34108 transitions. Second operand 13 states. [2020-02-10 19:36:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:25,963 INFO L93 Difference]: Finished difference Result 11835 states and 58420 transitions. [2020-02-10 19:36:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:25,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:25,993 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 19:36:25,993 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 19:36:25,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 19:36:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 19:36:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:36:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 19:36:26,613 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 19:36:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:26,613 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 19:36:26,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 19:36:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:26,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:26,625 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 526171826, now seen corresponding path program 89 times [2020-02-10 19:36:26,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:26,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283747755] [2020-02-10 19:36:26,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:27,278 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:27,427 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:27,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283747755] [2020-02-10 19:36:27,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:27,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:27,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117313932] [2020-02-10 19:36:27,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:27,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:27,440 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 19:36:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:27,782 INFO L93 Difference]: Finished difference Result 11830 states and 58410 transitions. [2020-02-10 19:36:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:27,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:27,811 INFO L225 Difference]: With dead ends: 11830 [2020-02-10 19:36:27,811 INFO L226 Difference]: Without dead ends: 11812 [2020-02-10 19:36:27,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2020-02-10 19:36:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 6213. [2020-02-10 19:36:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:36:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 19:36:28,434 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 19:36:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:28,434 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 19:36:28,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 19:36:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:28,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:28,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:28,446 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash 828457700, now seen corresponding path program 90 times [2020-02-10 19:36:28,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:28,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380901154] [2020-02-10 19:36:28,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:29,132 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:29,281 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:29,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 19:36:29,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380901154] [2020-02-10 19:36:29,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:29,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:29,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612130413] [2020-02-10 19:36:29,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:29,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:29,388 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:36:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:29,743 INFO L93 Difference]: Finished difference Result 11833 states and 58410 transitions. [2020-02-10 19:36:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:29,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:29,777 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 19:36:29,777 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 19:36:29,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 19:36:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6201. [2020-02-10 19:36:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 19:36:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34072 transitions. [2020-02-10 19:36:30,396 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34072 transitions. Word has length 34 [2020-02-10 19:36:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:30,397 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34072 transitions. [2020-02-10 19:36:30,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34072 transitions. [2020-02-10 19:36:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:30,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:30,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:30,408 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash 800234480, now seen corresponding path program 91 times [2020-02-10 19:36:30,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:30,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829268791] [2020-02-10 19:36:30,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:31,081 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:36:31,231 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:31,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829268791] [2020-02-10 19:36:31,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:31,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:31,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656490089] [2020-02-10 19:36:31,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:31,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:31,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:31,243 INFO L87 Difference]: Start difference. First operand 6201 states and 34072 transitions. Second operand 13 states. [2020-02-10 19:36:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:31,677 INFO L93 Difference]: Finished difference Result 11850 states and 58456 transitions. [2020-02-10 19:36:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:31,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:31,707 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 19:36:31,707 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 19:36:31,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 19:36:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6215. [2020-02-10 19:36:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:36:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 19:36:32,327 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 19:36:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:32,327 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 19:36:32,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 19:36:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:32,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:32,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:32,338 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1073813086, now seen corresponding path program 92 times [2020-02-10 19:36:32,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:32,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766835011] [2020-02-10 19:36:32,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:33,001 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:33,152 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:33,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766835011] [2020-02-10 19:36:33,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:33,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:33,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648936474] [2020-02-10 19:36:33,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:33,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:33,164 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:36:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:33,579 INFO L93 Difference]: Finished difference Result 11844 states and 58438 transitions. [2020-02-10 19:36:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:33,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:33,609 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 19:36:33,609 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 19:36:33,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 19:36:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6208. [2020-02-10 19:36:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:36:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34091 transitions. [2020-02-10 19:36:34,349 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34091 transitions. Word has length 34 [2020-02-10 19:36:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:34,349 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34091 transitions. [2020-02-10 19:36:34,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34091 transitions. [2020-02-10 19:36:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:34,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:34,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:34,361 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1581161982, now seen corresponding path program 93 times [2020-02-10 19:36:34,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:34,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354799703] [2020-02-10 19:36:34,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:34,887 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:35,038 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:36:35,184 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:35,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354799703] [2020-02-10 19:36:35,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:35,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:35,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779972351] [2020-02-10 19:36:35,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:35,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:35,196 INFO L87 Difference]: Start difference. First operand 6208 states and 34091 transitions. Second operand 13 states. [2020-02-10 19:36:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:35,498 INFO L93 Difference]: Finished difference Result 11856 states and 58464 transitions. [2020-02-10 19:36:35,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:35,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:35,531 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 19:36:35,532 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 19:36:35,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 19:36:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6218. [2020-02-10 19:36:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:36:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34109 transitions. [2020-02-10 19:36:36,158 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34109 transitions. Word has length 34 [2020-02-10 19:36:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:36,158 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34109 transitions. [2020-02-10 19:36:36,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34109 transitions. [2020-02-10 19:36:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:36,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:36,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:36,170 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 327945998, now seen corresponding path program 94 times [2020-02-10 19:36:36,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:36,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288709251] [2020-02-10 19:36:36,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:36,717 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:36,861 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:37,007 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:37,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288709251] [2020-02-10 19:36:37,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:37,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:37,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202194178] [2020-02-10 19:36:37,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:37,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:37,018 INFO L87 Difference]: Start difference. First operand 6218 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:36:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:37,309 INFO L93 Difference]: Finished difference Result 11853 states and 58449 transitions. [2020-02-10 19:36:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:37,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:37,339 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 19:36:37,339 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:36:37,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:36:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6208. [2020-02-10 19:36:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 19:36:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34084 transitions. [2020-02-10 19:36:37,957 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34084 transitions. Word has length 34 [2020-02-10 19:36:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:37,957 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34084 transitions. [2020-02-10 19:36:37,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34084 transitions. [2020-02-10 19:36:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:37,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:37,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:37,969 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1076438862, now seen corresponding path program 95 times [2020-02-10 19:36:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:37,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746604174] [2020-02-10 19:36:37,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:38,635 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:38,782 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:38,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 19:36:38,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746604174] [2020-02-10 19:36:38,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:38,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:38,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662932052] [2020-02-10 19:36:38,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:38,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:38,793 INFO L87 Difference]: Start difference. First operand 6208 states and 34084 transitions. Second operand 13 states. [2020-02-10 19:36:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:39,112 INFO L93 Difference]: Finished difference Result 11840 states and 58424 transitions. [2020-02-10 19:36:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:39,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:39,142 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 19:36:39,142 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 19:36:39,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 19:36:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6214. [2020-02-10 19:36:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:36:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 19:36:39,838 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 19:36:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:39,838 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 19:36:39,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 19:36:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:39,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:39,850 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1378724736, now seen corresponding path program 96 times [2020-02-10 19:36:39,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:39,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472190813] [2020-02-10 19:36:39,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:40,530 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:40,681 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:36:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:40,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472190813] [2020-02-10 19:36:40,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:40,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:40,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193173915] [2020-02-10 19:36:40,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:40,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:40,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:40,694 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 19:36:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:40,994 INFO L93 Difference]: Finished difference Result 11843 states and 58424 transitions. [2020-02-10 19:36:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:40,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:41,025 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 19:36:41,025 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 19:36:41,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 19:36:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6194. [2020-02-10 19:36:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 19:36:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34052 transitions. [2020-02-10 19:36:41,644 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34052 transitions. Word has length 34 [2020-02-10 19:36:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:41,644 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34052 transitions. [2020-02-10 19:36:41,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34052 transitions. [2020-02-10 19:36:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:41,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:41,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:41,655 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -685815432, now seen corresponding path program 97 times [2020-02-10 19:36:41,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:41,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779881816] [2020-02-10 19:36:41,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:42,195 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:36:42,340 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:42,488 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:42,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779881816] [2020-02-10 19:36:42,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:42,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:42,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577428166] [2020-02-10 19:36:42,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:42,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:42,500 INFO L87 Difference]: Start difference. First operand 6194 states and 34052 transitions. Second operand 13 states. [2020-02-10 19:36:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:42,855 INFO L93 Difference]: Finished difference Result 11821 states and 58407 transitions. [2020-02-10 19:36:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:42,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:42,884 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 19:36:42,884 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 19:36:42,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 19:36:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6212. [2020-02-10 19:36:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:36:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34115 transitions. [2020-02-10 19:36:43,505 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34115 transitions. Word has length 34 [2020-02-10 19:36:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:43,505 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34115 transitions. [2020-02-10 19:36:43,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34115 transitions. [2020-02-10 19:36:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:43,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:43,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:43,517 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -77164770, now seen corresponding path program 98 times [2020-02-10 19:36:43,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:43,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502666390] [2020-02-10 19:36:43,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:44,066 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:36:44,212 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:44,456 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:44,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502666390] [2020-02-10 19:36:44,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:44,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:44,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031649149] [2020-02-10 19:36:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:44,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:44,468 INFO L87 Difference]: Start difference. First operand 6212 states and 34115 transitions. Second operand 13 states. [2020-02-10 19:36:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:44,761 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 19:36:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:44,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:44,791 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 19:36:44,791 INFO L226 Difference]: Without dead ends: 11796 [2020-02-10 19:36:44,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11796 states. [2020-02-10 19:36:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11796 to 6206. [2020-02-10 19:36:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:36:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 19:36:45,412 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 19:36:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:45,413 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 19:36:45,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 19:36:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:45,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:45,424 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -954561860, now seen corresponding path program 99 times [2020-02-10 19:36:45,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:45,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544030965] [2020-02-10 19:36:45,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:46,084 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:46,233 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:46,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544030965] [2020-02-10 19:36:46,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:46,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:46,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028277805] [2020-02-10 19:36:46,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:46,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:46,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:46,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:46,245 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 19:36:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:46,548 INFO L93 Difference]: Finished difference Result 11826 states and 58412 transitions. [2020-02-10 19:36:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:46,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:46,577 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 19:36:46,577 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 19:36:46,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 19:36:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6213. [2020-02-10 19:36:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:36:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34111 transitions. [2020-02-10 19:36:47,197 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34111 transitions. Word has length 34 [2020-02-10 19:36:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:47,197 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34111 transitions. [2020-02-10 19:36:47,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34111 transitions. [2020-02-10 19:36:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:47,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:47,209 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1163024614, now seen corresponding path program 100 times [2020-02-10 19:36:47,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:47,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003150132] [2020-02-10 19:36:47,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:47,913 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:48,064 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:48,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003150132] [2020-02-10 19:36:48,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:48,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:48,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067935812] [2020-02-10 19:36:48,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:48,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:48,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:48,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:48,076 INFO L87 Difference]: Start difference. First operand 6213 states and 34111 transitions. Second operand 13 states. [2020-02-10 19:36:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:48,377 INFO L93 Difference]: Finished difference Result 11829 states and 58411 transitions. [2020-02-10 19:36:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:48,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:48,406 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 19:36:48,406 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 19:36:48,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 19:36:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6206. [2020-02-10 19:36:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:36:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 19:36:49,024 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 19:36:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:49,024 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 19:36:49,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 19:36:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:49,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:49,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:49,132 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:49,132 INFO L82 PathProgramCache]: Analyzing trace with hash -366897982, now seen corresponding path program 101 times [2020-02-10 19:36:49,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:49,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237786745] [2020-02-10 19:36:49,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:49,800 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:36:49,948 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:49,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237786745] [2020-02-10 19:36:49,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:49,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:49,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058229326] [2020-02-10 19:36:49,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:49,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:49,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:49,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:49,959 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 19:36:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:50,263 INFO L93 Difference]: Finished difference Result 11823 states and 58399 transitions. [2020-02-10 19:36:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:50,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:50,294 INFO L225 Difference]: With dead ends: 11823 [2020-02-10 19:36:50,294 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 19:36:50,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 19:36:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6212. [2020-02-10 19:36:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:36:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34103 transitions. [2020-02-10 19:36:50,914 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34103 transitions. Word has length 34 [2020-02-10 19:36:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:50,914 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34103 transitions. [2020-02-10 19:36:50,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34103 transitions. [2020-02-10 19:36:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:50,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:50,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:50,925 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 525276724, now seen corresponding path program 102 times [2020-02-10 19:36:50,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:50,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596224026] [2020-02-10 19:36:50,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:51,585 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:36:51,731 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:36:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:51,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596224026] [2020-02-10 19:36:51,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:51,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:51,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026162058] [2020-02-10 19:36:51,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:51,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:51,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:51,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:51,741 INFO L87 Difference]: Start difference. First operand 6212 states and 34103 transitions. Second operand 13 states. [2020-02-10 19:36:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:52,065 INFO L93 Difference]: Finished difference Result 11827 states and 58401 transitions. [2020-02-10 19:36:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:52,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:52,095 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 19:36:52,095 INFO L226 Difference]: Without dead ends: 11793 [2020-02-10 19:36:52,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2020-02-10 19:36:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 6200. [2020-02-10 19:36:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 19:36:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34075 transitions. [2020-02-10 19:36:52,710 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34075 transitions. Word has length 34 [2020-02-10 19:36:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:52,710 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34075 transitions. [2020-02-10 19:36:52,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34075 transitions. [2020-02-10 19:36:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:52,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:52,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:52,721 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2108656526, now seen corresponding path program 103 times [2020-02-10 19:36:52,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:52,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064601456] [2020-02-10 19:36:52,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:53,401 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:53,558 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:36:53,709 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:36:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:53,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064601456] [2020-02-10 19:36:53,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:53,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:53,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019789929] [2020-02-10 19:36:53,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:53,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:53,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:53,721 INFO L87 Difference]: Start difference. First operand 6200 states and 34075 transitions. Second operand 13 states. [2020-02-10 19:36:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:54,138 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 19:36:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:54,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:54,167 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 19:36:54,168 INFO L226 Difference]: Without dead ends: 11801 [2020-02-10 19:36:54,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2020-02-10 19:36:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 6212. [2020-02-10 19:36:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:36:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34109 transitions. [2020-02-10 19:36:54,877 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34109 transitions. Word has length 34 [2020-02-10 19:36:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:54,877 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34109 transitions. [2020-02-10 19:36:54,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34109 transitions. [2020-02-10 19:36:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:54,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:54,888 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1577660108, now seen corresponding path program 104 times [2020-02-10 19:36:54,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:54,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418102693] [2020-02-10 19:36:54,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:55,556 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:36:55,708 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:36:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:55,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418102693] [2020-02-10 19:36:55,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:55,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:55,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576905172] [2020-02-10 19:36:55,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:55,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:55,720 INFO L87 Difference]: Start difference. First operand 6212 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:36:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:56,138 INFO L93 Difference]: Finished difference Result 11819 states and 58391 transitions. [2020-02-10 19:36:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:56,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:56,167 INFO L225 Difference]: With dead ends: 11819 [2020-02-10 19:36:56,167 INFO L226 Difference]: Without dead ends: 11795 [2020-02-10 19:36:56,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2020-02-10 19:36:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 6206. [2020-02-10 19:36:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:36:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 19:36:56,792 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 19:36:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:56,792 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 19:36:56,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 19:36:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:56,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:56,803 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -979439620, now seen corresponding path program 105 times [2020-02-10 19:36:56,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:56,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393685683] [2020-02-10 19:36:56,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:57,473 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:36:57,619 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:36:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:57,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393685683] [2020-02-10 19:36:57,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:57,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:57,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767109272] [2020-02-10 19:36:57,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:57,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:57,630 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 19:36:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:57,929 INFO L93 Difference]: Finished difference Result 11824 states and 58402 transitions. [2020-02-10 19:36:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:57,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:57,959 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 19:36:57,959 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 19:36:57,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:36:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 19:36:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6213. [2020-02-10 19:36:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:36:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34105 transitions. [2020-02-10 19:36:58,579 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34105 transitions. Word has length 34 [2020-02-10 19:36:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:58,580 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34105 transitions. [2020-02-10 19:36:58,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:36:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34105 transitions. [2020-02-10 19:36:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:36:58,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:58,591 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 436720688, now seen corresponding path program 106 times [2020-02-10 19:36:58,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:58,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502856080] [2020-02-10 19:36:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:59,268 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:36:59,413 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:36:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:59,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502856080] [2020-02-10 19:36:59,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:59,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:36:59,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234322212] [2020-02-10 19:36:59,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:36:59,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:36:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:59,425 INFO L87 Difference]: Start difference. First operand 6213 states and 34105 transitions. Second operand 13 states. [2020-02-10 19:36:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:59,814 INFO L93 Difference]: Finished difference Result 11826 states and 58399 transitions. [2020-02-10 19:36:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:36:59,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:36:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:59,843 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 19:36:59,844 INFO L226 Difference]: Without dead ends: 11798 [2020-02-10 19:36:59,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2020-02-10 19:37:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 6206. [2020-02-10 19:37:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:37:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34086 transitions. [2020-02-10 19:37:00,460 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34086 transitions. Word has length 34 [2020-02-10 19:37:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:00,460 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34086 transitions. [2020-02-10 19:37:00,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34086 transitions. [2020-02-10 19:37:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:00,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:00,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:00,471 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1822736152, now seen corresponding path program 107 times [2020-02-10 19:37:00,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:00,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621047033] [2020-02-10 19:37:00,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:01,140 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:01,288 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:01,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621047033] [2020-02-10 19:37:01,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:01,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:01,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049573432] [2020-02-10 19:37:01,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:01,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:01,300 INFO L87 Difference]: Start difference. First operand 6206 states and 34086 transitions. Second operand 13 states. [2020-02-10 19:37:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:01,665 INFO L93 Difference]: Finished difference Result 11821 states and 58389 transitions. [2020-02-10 19:37:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:01,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:01,695 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 19:37:01,696 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 19:37:01,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 19:37:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6212. [2020-02-10 19:37:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:37:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 19:37:02,315 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 19:37:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:02,315 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 19:37:02,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 19:37:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:02,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:02,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:02,326 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2125022026, now seen corresponding path program 108 times [2020-02-10 19:37:02,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:02,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948471072] [2020-02-10 19:37:02,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:02,983 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:03,137 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:03,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948471072] [2020-02-10 19:37:03,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:03,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:03,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331402035] [2020-02-10 19:37:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:03,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:03,149 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 19:37:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:03,547 INFO L93 Difference]: Finished difference Result 11824 states and 58389 transitions. [2020-02-10 19:37:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:03,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:03,577 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 19:37:03,577 INFO L226 Difference]: Without dead ends: 11791 [2020-02-10 19:37:03,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11791 states. [2020-02-10 19:37:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11791 to 6200. [2020-02-10 19:37:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 19:37:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34069 transitions. [2020-02-10 19:37:04,205 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34069 transitions. Word has length 34 [2020-02-10 19:37:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:04,205 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34069 transitions. [2020-02-10 19:37:04,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34069 transitions. [2020-02-10 19:37:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:04,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:04,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:04,217 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2098705422, now seen corresponding path program 109 times [2020-02-10 19:37:04,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:04,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544439855] [2020-02-10 19:37:04,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:04,553 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 19:37:04,986 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:37:05,134 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:05,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544439855] [2020-02-10 19:37:05,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:05,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:05,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117781354] [2020-02-10 19:37:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:05,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:05,147 INFO L87 Difference]: Start difference. First operand 6200 states and 34069 transitions. Second operand 13 states. [2020-02-10 19:37:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:05,510 INFO L93 Difference]: Finished difference Result 11834 states and 58428 transitions. [2020-02-10 19:37:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:05,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:05,541 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 19:37:05,542 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 19:37:05,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 19:37:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6214. [2020-02-10 19:37:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:37:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34109 transitions. [2020-02-10 19:37:06,166 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34109 transitions. Word has length 34 [2020-02-10 19:37:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:06,167 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34109 transitions. [2020-02-10 19:37:06,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34109 transitions. [2020-02-10 19:37:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:06,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:06,178 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1890242668, now seen corresponding path program 110 times [2020-02-10 19:37:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:06,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366764158] [2020-02-10 19:37:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:06,853 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:07,002 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:07,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366764158] [2020-02-10 19:37:07,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:07,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:07,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255550390] [2020-02-10 19:37:07,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:07,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:07,016 INFO L87 Difference]: Start difference. First operand 6214 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:37:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:07,361 INFO L93 Difference]: Finished difference Result 11837 states and 58427 transitions. [2020-02-10 19:37:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:07,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:07,391 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 19:37:07,391 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 19:37:07,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 19:37:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6207. [2020-02-10 19:37:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:37:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 19:37:08,008 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 19:37:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:08,008 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 19:37:08,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 19:37:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:08,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:08,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:08,020 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -720644296, now seen corresponding path program 111 times [2020-02-10 19:37:08,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:08,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860603856] [2020-02-10 19:37:08,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:08,702 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:08,847 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:08,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860603856] [2020-02-10 19:37:08,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:08,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:08,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799863303] [2020-02-10 19:37:08,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:08,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:08,860 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 19:37:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:09,259 INFO L93 Difference]: Finished difference Result 11833 states and 58419 transitions. [2020-02-10 19:37:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:09,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:09,289 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 19:37:09,289 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 19:37:09,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 19:37:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 19:37:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:37:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34102 transitions. [2020-02-10 19:37:09,995 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34102 transitions. Word has length 34 [2020-02-10 19:37:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:09,995 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34102 transitions. [2020-02-10 19:37:09,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34102 transitions. [2020-02-10 19:37:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:10,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:10,007 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 695516012, now seen corresponding path program 112 times [2020-02-10 19:37:10,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:10,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126614841] [2020-02-10 19:37:10,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:10,688 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:10,842 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:10,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126614841] [2020-02-10 19:37:10,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:10,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:10,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616900642] [2020-02-10 19:37:10,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:10,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:10,855 INFO L87 Difference]: Start difference. First operand 6214 states and 34102 transitions. Second operand 13 states. [2020-02-10 19:37:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:11,261 INFO L93 Difference]: Finished difference Result 11835 states and 58416 transitions. [2020-02-10 19:37:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:11,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:11,290 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 19:37:11,291 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 19:37:11,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 19:37:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 19:37:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:37:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34082 transitions. [2020-02-10 19:37:11,914 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34082 transitions. Word has length 34 [2020-02-10 19:37:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:11,914 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34082 transitions. [2020-02-10 19:37:11,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34082 transitions. [2020-02-10 19:37:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:11,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:11,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:11,925 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1453428040, now seen corresponding path program 113 times [2020-02-10 19:37:11,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:11,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077457332] [2020-02-10 19:37:11,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:12,450 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:12,592 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:12,740 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:12,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077457332] [2020-02-10 19:37:12,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:12,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782843877] [2020-02-10 19:37:12,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:12,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:12,753 INFO L87 Difference]: Start difference. First operand 6207 states and 34082 transitions. Second operand 13 states. [2020-02-10 19:37:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:13,126 INFO L93 Difference]: Finished difference Result 11841 states and 58430 transitions. [2020-02-10 19:37:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:13,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:13,155 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 19:37:13,156 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 19:37:13,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 19:37:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6216. [2020-02-10 19:37:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:37:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34099 transitions. [2020-02-10 19:37:13,784 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34099 transitions. Word has length 34 [2020-02-10 19:37:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:13,784 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34099 transitions. [2020-02-10 19:37:13,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34099 transitions. [2020-02-10 19:37:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:13,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:13,795 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1471862066, now seen corresponding path program 114 times [2020-02-10 19:37:13,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:13,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977995795] [2020-02-10 19:37:13,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:14,342 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:14,488 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:14,636 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:14,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977995795] [2020-02-10 19:37:14,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:14,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:14,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151300548] [2020-02-10 19:37:14,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:14,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:14,648 INFO L87 Difference]: Start difference. First operand 6216 states and 34099 transitions. Second operand 13 states. [2020-02-10 19:37:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:15,031 INFO L93 Difference]: Finished difference Result 11840 states and 58419 transitions. [2020-02-10 19:37:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:15,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:15,061 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 19:37:15,062 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 19:37:15,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 19:37:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6200. [2020-02-10 19:37:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 19:37:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34063 transitions. [2020-02-10 19:37:15,759 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34063 transitions. Word has length 34 [2020-02-10 19:37:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:15,760 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34063 transitions. [2020-02-10 19:37:15,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34063 transitions. [2020-02-10 19:37:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:15,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:15,770 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1966170974, now seen corresponding path program 115 times [2020-02-10 19:37:15,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:15,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370183037] [2020-02-10 19:37:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:16,417 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:37:16,565 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:16,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370183037] [2020-02-10 19:37:16,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:16,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:16,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624920424] [2020-02-10 19:37:16,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:16,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:16,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:16,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:16,576 INFO L87 Difference]: Start difference. First operand 6200 states and 34063 transitions. Second operand 13 states. [2020-02-10 19:37:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:16,871 INFO L93 Difference]: Finished difference Result 11827 states and 58403 transitions. [2020-02-10 19:37:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:16,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:16,901 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 19:37:16,901 INFO L226 Difference]: Without dead ends: 11809 [2020-02-10 19:37:16,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2020-02-10 19:37:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 6212. [2020-02-10 19:37:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:37:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 19:37:17,520 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 19:37:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:17,520 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 19:37:17,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 19:37:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:17,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:17,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:17,531 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1436621616, now seen corresponding path program 116 times [2020-02-10 19:37:17,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:17,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879074652] [2020-02-10 19:37:17,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:18,217 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:18,367 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37: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 19:37:18,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879074652] [2020-02-10 19:37:18,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:18,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:18,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242294309] [2020-02-10 19:37:18,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:18,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:18,378 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 19:37:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:18,667 INFO L93 Difference]: Finished difference Result 11831 states and 58405 transitions. [2020-02-10 19:37:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:18,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:18,698 INFO L225 Difference]: With dead ends: 11831 [2020-02-10 19:37:18,698 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 19:37:18,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 19:37:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6206. [2020-02-10 19:37:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:37:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34080 transitions. [2020-02-10 19:37:19,321 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34080 transitions. Word has length 34 [2020-02-10 19:37:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:19,321 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34080 transitions. [2020-02-10 19:37:19,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34080 transitions. [2020-02-10 19:37:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:19,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:19,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:19,332 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1430941172, now seen corresponding path program 117 times [2020-02-10 19:37:19,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:19,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431488985] [2020-02-10 19:37:19,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:19,985 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:20,138 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:20,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431488985] [2020-02-10 19:37:20,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:20,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:20,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584160097] [2020-02-10 19:37:20,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:20,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:20,150 INFO L87 Difference]: Start difference. First operand 6206 states and 34080 transitions. Second operand 13 states. [2020-02-10 19:37:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:20,527 INFO L93 Difference]: Finished difference Result 11826 states and 58395 transitions. [2020-02-10 19:37:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:20,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:20,557 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 19:37:20,557 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 19:37:20,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 19:37:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6212. [2020-02-10 19:37:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:37:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34091 transitions. [2020-02-10 19:37:21,184 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34091 transitions. Word has length 34 [2020-02-10 19:37:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:21,184 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34091 transitions. [2020-02-10 19:37:21,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34091 transitions. [2020-02-10 19:37:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:21,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:21,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:21,196 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1733227046, now seen corresponding path program 118 times [2020-02-10 19:37:21,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:21,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507413070] [2020-02-10 19:37:21,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:21,861 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:22,007 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:22,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507413070] [2020-02-10 19:37:22,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:22,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:22,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482051802] [2020-02-10 19:37:22,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:22,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:22,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:22,018 INFO L87 Difference]: Start difference. First operand 6212 states and 34091 transitions. Second operand 13 states. [2020-02-10 19:37:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:22,324 INFO L93 Difference]: Finished difference Result 11829 states and 58395 transitions. [2020-02-10 19:37:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:22,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:22,354 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 19:37:22,354 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 19:37:22,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 19:37:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6206. [2020-02-10 19:37:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:37:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34074 transitions. [2020-02-10 19:37:22,975 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34074 transitions. Word has length 34 [2020-02-10 19:37:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:22,976 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34074 transitions. [2020-02-10 19:37:22,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34074 transitions. [2020-02-10 19:37:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:22,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:22,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:22,987 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -655694114, now seen corresponding path program 119 times [2020-02-10 19:37:22,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:22,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456343485] [2020-02-10 19:37:22,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:23,515 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:23,659 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:23,804 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:23,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456343485] [2020-02-10 19:37:23,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:23,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:23,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336982692] [2020-02-10 19:37:23,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:23,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:23,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:23,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:23,817 INFO L87 Difference]: Start difference. First operand 6206 states and 34074 transitions. Second operand 13 states. [2020-02-10 19:37:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:24,118 INFO L93 Difference]: Finished difference Result 11837 states and 58414 transitions. [2020-02-10 19:37:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:24,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:24,148 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 19:37:24,148 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 19:37:24,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 19:37:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6215. [2020-02-10 19:37:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:37:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34091 transitions. [2020-02-10 19:37:24,766 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34091 transitions. Word has length 34 [2020-02-10 19:37:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:24,767 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34091 transitions. [2020-02-10 19:37:24,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34091 transitions. [2020-02-10 19:37:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:24,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:24,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:24,780 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash -674128140, now seen corresponding path program 120 times [2020-02-10 19:37:24,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:24,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284487225] [2020-02-10 19:37:24,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:25,281 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 19:37:25,405 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:25,550 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:25,694 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37: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 19:37:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284487225] [2020-02-10 19:37:25,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:25,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:25,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596414036] [2020-02-10 19:37:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:25,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:25,706 INFO L87 Difference]: Start difference. First operand 6215 states and 34091 transitions. Second operand 13 states. [2020-02-10 19:37:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:26,048 INFO L93 Difference]: Finished difference Result 11836 states and 58403 transitions. [2020-02-10 19:37:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:26,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:26,079 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 19:37:26,079 INFO L226 Difference]: Without dead ends: 11785 [2020-02-10 19:37:26,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2020-02-10 19:37:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 6185. [2020-02-10 19:37:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 19:37:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34029 transitions. [2020-02-10 19:37:26,708 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34029 transitions. Word has length 34 [2020-02-10 19:37:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:26,708 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34029 transitions. [2020-02-10 19:37:26,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34029 transitions. [2020-02-10 19:37:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:26,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:26,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:26,719 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -107252240, now seen corresponding path program 121 times [2020-02-10 19:37:26,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:26,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138970875] [2020-02-10 19:37:26,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:27,271 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:37:27,418 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:37:27,565 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:37:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:27,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138970875] [2020-02-10 19:37:27,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:27,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:27,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20203356] [2020-02-10 19:37:27,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:27,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:27,578 INFO L87 Difference]: Start difference. First operand 6185 states and 34029 transitions. Second operand 13 states. [2020-02-10 19:37:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:27,874 INFO L93 Difference]: Finished difference Result 11918 states and 58698 transitions. [2020-02-10 19:37:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:27,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:27,903 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 19:37:27,903 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 19:37:27,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 19:37:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6228. [2020-02-10 19:37:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:37:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 19:37:28,521 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 19:37:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:28,521 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 19:37:28,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 19:37:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:28,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:28,532 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash -743719094, now seen corresponding path program 122 times [2020-02-10 19:37:28,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:28,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292189106] [2020-02-10 19:37:28,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:29,091 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:37:29,235 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:29,384 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:29,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292189106] [2020-02-10 19:37:29,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:29,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:29,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583416905] [2020-02-10 19:37:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:29,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:29,398 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 19:37:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:29,723 INFO L93 Difference]: Finished difference Result 11916 states and 58684 transitions. [2020-02-10 19:37:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:29,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:29,752 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 19:37:29,752 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 19:37:29,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 19:37:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6216. [2020-02-10 19:37:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:37:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34151 transitions. [2020-02-10 19:37:30,485 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34151 transitions. Word has length 34 [2020-02-10 19:37:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:30,485 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34151 transitions. [2020-02-10 19:37:30,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34151 transitions. [2020-02-10 19:37:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:30,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:30,497 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1656002464, now seen corresponding path program 123 times [2020-02-10 19:37:30,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:30,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411367401] [2020-02-10 19:37:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:31,052 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:37:31,195 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:37:31,343 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:37:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:31,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411367401] [2020-02-10 19:37:31,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:31,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:31,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951783748] [2020-02-10 19:37:31,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:31,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:31,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:31,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:31,356 INFO L87 Difference]: Start difference. First operand 6216 states and 34151 transitions. Second operand 13 states. [2020-02-10 19:37:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:31,766 INFO L93 Difference]: Finished difference Result 11906 states and 58664 transitions. [2020-02-10 19:37:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:31,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:31,798 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 19:37:31,798 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 19:37:31,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 19:37:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6224. [2020-02-10 19:37:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 19:37:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34166 transitions. [2020-02-10 19:37:32,416 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34166 transitions. Word has length 34 [2020-02-10 19:37:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:32,416 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34166 transitions. [2020-02-10 19:37:32,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34166 transitions. [2020-02-10 19:37:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:32,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:32,428 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash 671066180, now seen corresponding path program 124 times [2020-02-10 19:37:32,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:32,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073912988] [2020-02-10 19:37:32,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:32,995 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:37:33,139 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:37:33,289 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:37:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:33,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073912988] [2020-02-10 19:37:33,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:33,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:33,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040184868] [2020-02-10 19:37:33,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:33,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:33,301 INFO L87 Difference]: Start difference. First operand 6224 states and 34166 transitions. Second operand 13 states. [2020-02-10 19:37:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:33,701 INFO L93 Difference]: Finished difference Result 11911 states and 58666 transitions. [2020-02-10 19:37:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:33,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:33,730 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 19:37:33,731 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 19:37:33,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 19:37:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6216. [2020-02-10 19:37:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:37:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34143 transitions. [2020-02-10 19:37:34,351 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34143 transitions. Word has length 34 [2020-02-10 19:37:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:34,351 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34143 transitions. [2020-02-10 19:37:34,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34143 transitions. [2020-02-10 19:37:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:34,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:34,362 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash -894600826, now seen corresponding path program 125 times [2020-02-10 19:37:34,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:34,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338111099] [2020-02-10 19:37:34,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:35,056 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:37:35,200 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:35,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338111099] [2020-02-10 19:37:35,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:35,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:35,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352262257] [2020-02-10 19:37:35,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:35,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:35,212 INFO L87 Difference]: Start difference. First operand 6216 states and 34143 transitions. Second operand 13 states. [2020-02-10 19:37:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:35,535 INFO L93 Difference]: Finished difference Result 11903 states and 58651 transitions. [2020-02-10 19:37:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:35,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:35,566 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 19:37:35,566 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 19:37:35,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 19:37:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6223. [2020-02-10 19:37:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:37:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34156 transitions. [2020-02-10 19:37:36,261 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34156 transitions. Word has length 34 [2020-02-10 19:37:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:36,261 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34156 transitions. [2020-02-10 19:37:36,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34156 transitions. [2020-02-10 19:37:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:36,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:36,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:36,272 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1103063580, now seen corresponding path program 126 times [2020-02-10 19:37:36,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:36,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564015201] [2020-02-10 19:37:36,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:36,842 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 19:37:36,986 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:37,133 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:37,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 19:37:37,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564015201] [2020-02-10 19:37:37,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:37,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:37,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666525749] [2020-02-10 19:37:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:37,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:37,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:37,144 INFO L87 Difference]: Start difference. First operand 6223 states and 34156 transitions. Second operand 13 states. [2020-02-10 19:37:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:37,517 INFO L93 Difference]: Finished difference Result 11906 states and 58650 transitions. [2020-02-10 19:37:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:37,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:37,547 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 19:37:37,547 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 19:37:37,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 19:37:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6207. [2020-02-10 19:37:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:37:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34119 transitions. [2020-02-10 19:37:38,171 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34119 transitions. Word has length 34 [2020-02-10 19:37:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:38,171 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34119 transitions. [2020-02-10 19:37:38,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34119 transitions. [2020-02-10 19:37:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:38,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:38,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:38,182 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:38,182 INFO L82 PathProgramCache]: Analyzing trace with hash 214145790, now seen corresponding path program 127 times [2020-02-10 19:37:38,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:38,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680566955] [2020-02-10 19:37:38,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:38,753 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:37:38,903 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 19:37:39,049 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 19:37:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680566955] [2020-02-10 19:37:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:39,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:39,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803670526] [2020-02-10 19:37:39,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:39,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:39,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:39,062 INFO L87 Difference]: Start difference. First operand 6207 states and 34119 transitions. Second operand 13 states. [2020-02-10 19:37:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:39,332 INFO L93 Difference]: Finished difference Result 11927 states and 58714 transitions. [2020-02-10 19:37:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:39,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:39,362 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 19:37:39,362 INFO L226 Difference]: Without dead ends: 11903 [2020-02-10 19:37:39,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11903 states. [2020-02-10 19:37:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11903 to 6231. [2020-02-10 19:37:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 19:37:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34181 transitions. [2020-02-10 19:37:39,983 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34181 transitions. Word has length 34 [2020-02-10 19:37:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:39,983 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34181 transitions. [2020-02-10 19:37:39,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34181 transitions. [2020-02-10 19:37:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:39,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:39,998 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash -422321064, now seen corresponding path program 128 times [2020-02-10 19:37:39,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:39,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795873979] [2020-02-10 19:37:39,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:40,569 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:37:40,717 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:40,864 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:40,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795873979] [2020-02-10 19:37:40,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:40,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:40,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548799806] [2020-02-10 19:37:40,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:40,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:40,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:40,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:40,877 INFO L87 Difference]: Start difference. First operand 6231 states and 34181 transitions. Second operand 13 states. [2020-02-10 19:37:41,246 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 19:37:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:41,272 INFO L93 Difference]: Finished difference Result 11925 states and 58700 transitions. [2020-02-10 19:37:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:41,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:41,304 INFO L225 Difference]: With dead ends: 11925 [2020-02-10 19:37:41,304 INFO L226 Difference]: Without dead ends: 11891 [2020-02-10 19:37:41,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2020-02-10 19:37:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 6219. [2020-02-10 19:37:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:37:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34149 transitions. [2020-02-10 19:37:41,930 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34149 transitions. Word has length 34 [2020-02-10 19:37:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:41,930 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34149 transitions. [2020-02-10 19:37:41,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34149 transitions. [2020-02-10 19:37:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:41,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:41,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:41,941 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:41,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1142165220, now seen corresponding path program 129 times [2020-02-10 19:37:41,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:41,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295851079] [2020-02-10 19:37:41,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:42,504 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:42,659 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:37:42,809 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:42,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295851079] [2020-02-10 19:37:42,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:42,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156095446] [2020-02-10 19:37:42,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:42,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:42,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:42,822 INFO L87 Difference]: Start difference. First operand 6219 states and 34149 transitions. Second operand 13 states. [2020-02-10 19:37:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:43,223 INFO L93 Difference]: Finished difference Result 11924 states and 58697 transitions. [2020-02-10 19:37:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:43,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:43,254 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 19:37:43,254 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 19:37:43,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 19:37:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6229. [2020-02-10 19:37:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2020-02-10 19:37:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 34167 transitions. [2020-02-10 19:37:43,877 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 34167 transitions. Word has length 34 [2020-02-10 19:37:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:43,877 INFO L479 AbstractCegarLoop]: Abstraction has 6229 states and 34167 transitions. [2020-02-10 19:37:43,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 34167 transitions. [2020-02-10 19:37:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:43,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:43,889 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash -555079724, now seen corresponding path program 130 times [2020-02-10 19:37:43,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:43,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785884640] [2020-02-10 19:37:43,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:44,594 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:37:44,740 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:44,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785884640] [2020-02-10 19:37:44,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:44,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:44,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207795915] [2020-02-10 19:37:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:44,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:44,753 INFO L87 Difference]: Start difference. First operand 6229 states and 34167 transitions. Second operand 13 states. [2020-02-10 19:37:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:45,095 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 19:37:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:45,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:45,124 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 19:37:45,124 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 19:37:45,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 19:37:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6219. [2020-02-10 19:37:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:37:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34139 transitions. [2020-02-10 19:37:45,757 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34139 transitions. Word has length 34 [2020-02-10 19:37:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:45,757 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34139 transitions. [2020-02-10 19:37:45,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34139 transitions. [2020-02-10 19:37:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:45,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:45,770 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2044904924, now seen corresponding path program 131 times [2020-02-10 19:37:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:45,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061440283] [2020-02-10 19:37:45,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:46,469 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:46,711 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:37:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:46,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061440283] [2020-02-10 19:37:46,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:46,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:46,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712933375] [2020-02-10 19:37:46,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:46,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:46,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:46,723 INFO L87 Difference]: Start difference. First operand 6219 states and 34139 transitions. Second operand 13 states. [2020-02-10 19:37:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:47,118 INFO L93 Difference]: Finished difference Result 11919 states and 58679 transitions. [2020-02-10 19:37:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:47,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:47,149 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 19:37:47,149 INFO L226 Difference]: Without dead ends: 11897 [2020-02-10 19:37:47,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11897 states. [2020-02-10 19:37:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11897 to 6228. [2020-02-10 19:37:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:37:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34156 transitions. [2020-02-10 19:37:47,768 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34156 transitions. Word has length 34 [2020-02-10 19:37:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:47,768 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34156 transitions. [2020-02-10 19:37:47,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34156 transitions. [2020-02-10 19:37:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:47,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:47,780 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1189284282, now seen corresponding path program 132 times [2020-02-10 19:37:47,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:47,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744816507] [2020-02-10 19:37:47,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:48,386 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:48,530 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:37:48,679 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:37:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:48,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744816507] [2020-02-10 19:37:48,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:48,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:48,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676787102] [2020-02-10 19:37:48,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:48,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:48,691 INFO L87 Difference]: Start difference. First operand 6228 states and 34156 transitions. Second operand 13 states. [2020-02-10 19:37:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:49,015 INFO L93 Difference]: Finished difference Result 11918 states and 58668 transitions. [2020-02-10 19:37:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:49,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:49,045 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 19:37:49,045 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 19:37:49,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 19:37:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6207. [2020-02-10 19:37:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:37:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34109 transitions. [2020-02-10 19:37:49,665 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34109 transitions. Word has length 34 [2020-02-10 19:37:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:49,665 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34109 transitions. [2020-02-10 19:37:49,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34109 transitions. [2020-02-10 19:37:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:49,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:49,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:49,676 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 359833722, now seen corresponding path program 133 times [2020-02-10 19:37:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:49,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688910567] [2020-02-10 19:37:49,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:50,243 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:37:50,387 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:50,529 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:50,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688910567] [2020-02-10 19:37:50,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:50,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:50,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567667877] [2020-02-10 19:37:50,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:50,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:50,541 INFO L87 Difference]: Start difference. First operand 6207 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:37:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:50,920 INFO L93 Difference]: Finished difference Result 11902 states and 58646 transitions. [2020-02-10 19:37:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:50,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:50,949 INFO L225 Difference]: With dead ends: 11902 [2020-02-10 19:37:50,949 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 19:37:50,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 19:37:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6223. [2020-02-10 19:37:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:37:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 19:37:51,568 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 19:37:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:51,568 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 19:37:51,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 19:37:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:51,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:51,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:51,579 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash -625102562, now seen corresponding path program 134 times [2020-02-10 19:37:51,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:51,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960222280] [2020-02-10 19:37:51,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:52,222 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:37:52,373 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:37:52,523 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:52,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960222280] [2020-02-10 19:37:52,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:52,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:52,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001840816] [2020-02-10 19:37:52,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:52,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:52,536 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 19:37:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:52,939 INFO L93 Difference]: Finished difference Result 11907 states and 58648 transitions. [2020-02-10 19:37:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:52,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:52,969 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 19:37:52,970 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 19:37:52,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 19:37:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6215. [2020-02-10 19:37:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:37:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 19:37:53,589 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 19:37:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:53,589 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 19:37:53,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 19:37:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:53,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:53,601 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash -715151990, now seen corresponding path program 135 times [2020-02-10 19:37:53,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:53,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24472705] [2020-02-10 19:37:53,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:54,291 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:37:54,437 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:54,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24472705] [2020-02-10 19:37:54,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:54,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:54,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491999539] [2020-02-10 19:37:54,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:54,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:54,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:54,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:54,449 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:37:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:54,894 INFO L93 Difference]: Finished difference Result 11898 states and 58631 transitions. [2020-02-10 19:37:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:54,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:54,924 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 19:37:54,924 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 19:37:54,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 19:37:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6222. [2020-02-10 19:37:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:37:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 19:37:55,554 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 19:37:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:55,554 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 19:37:55,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 19:37:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:55,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:55,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:55,568 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 701008318, now seen corresponding path program 136 times [2020-02-10 19:37:55,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:55,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322955863] [2020-02-10 19:37:55,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:56,262 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:37:56,413 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:56,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322955863] [2020-02-10 19:37:56,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:56,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:56,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417114111] [2020-02-10 19:37:56,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:56,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:56,425 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 19:37:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:56,917 INFO L93 Difference]: Finished difference Result 11900 states and 58628 transitions. [2020-02-10 19:37:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:56,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:56,947 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:37:56,947 INFO L226 Difference]: Without dead ends: 11872 [2020-02-10 19:37:56,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2020-02-10 19:37:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 6215. [2020-02-10 19:37:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:37:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34124 transitions. [2020-02-10 19:37:57,660 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34124 transitions. Word has length 34 [2020-02-10 19:37:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:57,660 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34124 transitions. [2020-02-10 19:37:57,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34124 transitions. [2020-02-10 19:37:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:57,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:57,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:57,672 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash 326194026, now seen corresponding path program 137 times [2020-02-10 19:37:57,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:57,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548460330] [2020-02-10 19:37:57,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:58,227 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:58,379 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:37:58,526 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:37:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:58,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548460330] [2020-02-10 19:37:58,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:58,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:37:58,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185187813] [2020-02-10 19:37:58,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:37:58,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:37:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:58,537 INFO L87 Difference]: Start difference. First operand 6215 states and 34124 transitions. Second operand 13 states. [2020-02-10 19:37:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:58,785 INFO L93 Difference]: Finished difference Result 11911 states and 58650 transitions. [2020-02-10 19:37:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:37:58,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:37:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:58,815 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 19:37:58,815 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 19:37:58,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:37:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 19:37:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 19:37:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:37:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34142 transitions. [2020-02-10 19:37:59,435 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34142 transitions. Word has length 34 [2020-02-10 19:37:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:59,435 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34142 transitions. [2020-02-10 19:37:59,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:37:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34142 transitions. [2020-02-10 19:37:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:37:59,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:59,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:59,446 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash -927021958, now seen corresponding path program 138 times [2020-02-10 19:37:59,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:59,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709346767] [2020-02-10 19:37:59,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:59,995 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:00,139 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:38:00,287 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:38:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:00,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709346767] [2020-02-10 19:38:00,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:00,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:00,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828295531] [2020-02-10 19:38:00,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:00,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:00,298 INFO L87 Difference]: Start difference. First operand 6225 states and 34142 transitions. Second operand 13 states. [2020-02-10 19:38:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:00,586 INFO L93 Difference]: Finished difference Result 11908 states and 58635 transitions. [2020-02-10 19:38:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:00,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:00,615 INFO L225 Difference]: With dead ends: 11908 [2020-02-10 19:38:00,615 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 19:38:00,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 19:38:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6207. [2020-02-10 19:38:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 19:38:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34101 transitions. [2020-02-10 19:38:01,238 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34101 transitions. Word has length 34 [2020-02-10 19:38:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:01,238 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34101 transitions. [2020-02-10 19:38:01,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34101 transitions. [2020-02-10 19:38:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:01,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:01,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:01,249 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:01,249 INFO L82 PathProgramCache]: Analyzing trace with hash 344907066, now seen corresponding path program 139 times [2020-02-10 19:38:01,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:01,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931811551] [2020-02-10 19:38:01,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:01,938 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:38:02,092 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931811551] [2020-02-10 19:38:02,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825425763] [2020-02-10 19:38:02,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:02,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:02,104 INFO L87 Difference]: Start difference. First operand 6207 states and 34101 transitions. Second operand 13 states. [2020-02-10 19:38:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:02,391 INFO L93 Difference]: Finished difference Result 11894 states and 58623 transitions. [2020-02-10 19:38:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:02,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:02,421 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 19:38:02,421 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 19:38:02,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 19:38:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6221. [2020-02-10 19:38:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:38:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34141 transitions. [2020-02-10 19:38:03,135 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34141 transitions. Word has length 34 [2020-02-10 19:38:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:03,136 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34141 transitions. [2020-02-10 19:38:03,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34141 transitions. [2020-02-10 19:38:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:03,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:03,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:03,147 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 136444312, now seen corresponding path program 140 times [2020-02-10 19:38:03,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:03,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992768117] [2020-02-10 19:38:03,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:03,826 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:38:03,978 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:03,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992768117] [2020-02-10 19:38:03,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:03,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:03,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781241935] [2020-02-10 19:38:03,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:03,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:03,990 INFO L87 Difference]: Start difference. First operand 6221 states and 34141 transitions. Second operand 13 states. [2020-02-10 19:38:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:04,293 INFO L93 Difference]: Finished difference Result 11897 states and 58622 transitions. [2020-02-10 19:38:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:04,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:04,324 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 19:38:04,325 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 19:38:04,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 19:38:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 19:38:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:38:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34121 transitions. [2020-02-10 19:38:04,946 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34121 transitions. Word has length 34 [2020-02-10 19:38:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:04,946 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34121 transitions. [2020-02-10 19:38:04,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34121 transitions. [2020-02-10 19:38:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:04,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:04,957 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1820524644, now seen corresponding path program 141 times [2020-02-10 19:38:04,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:04,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530828863] [2020-02-10 19:38:04,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:05,655 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:05,806 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:05,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530828863] [2020-02-10 19:38:05,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:05,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:05,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9575086] [2020-02-10 19:38:05,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:05,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:05,819 INFO L87 Difference]: Start difference. First operand 6214 states and 34121 transitions. Second operand 13 states. [2020-02-10 19:38:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:06,185 INFO L93 Difference]: Finished difference Result 11893 states and 58614 transitions. [2020-02-10 19:38:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:06,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:06,214 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 19:38:06,214 INFO L226 Difference]: Without dead ends: 11874 [2020-02-10 19:38:06,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11874 states. [2020-02-10 19:38:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11874 to 6221. [2020-02-10 19:38:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:38:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34134 transitions. [2020-02-10 19:38:06,832 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34134 transitions. Word has length 34 [2020-02-10 19:38:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:06,832 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34134 transitions. [2020-02-10 19:38:06,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34134 transitions. [2020-02-10 19:38:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:06,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:06,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:06,843 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:06,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1058282344, now seen corresponding path program 142 times [2020-02-10 19:38:06,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:06,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635166269] [2020-02-10 19:38:06,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:07,529 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:07,679 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:07,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635166269] [2020-02-10 19:38:07,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:07,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:07,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764695854] [2020-02-10 19:38:07,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:07,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:07,691 INFO L87 Difference]: Start difference. First operand 6221 states and 34134 transitions. Second operand 13 states. [2020-02-10 19:38:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:08,057 INFO L93 Difference]: Finished difference Result 11895 states and 58611 transitions. [2020-02-10 19:38:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:08,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:08,086 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 19:38:08,086 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 19:38:08,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 19:38:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 19:38:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:38:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34114 transitions. [2020-02-10 19:38:08,782 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34114 transitions. Word has length 34 [2020-02-10 19:38:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:08,783 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34114 transitions. [2020-02-10 19:38:08,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34114 transitions. [2020-02-10 19:38:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:08,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:08,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:08,794 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1087740900, now seen corresponding path program 143 times [2020-02-10 19:38:08,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:08,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310438510] [2020-02-10 19:38:08,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:09,344 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:09,486 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:38:09,635 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:09,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310438510] [2020-02-10 19:38:09,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:09,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:09,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398373827] [2020-02-10 19:38:09,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:09,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:09,647 INFO L87 Difference]: Start difference. First operand 6214 states and 34114 transitions. Second operand 13 states. [2020-02-10 19:38:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:10,031 INFO L93 Difference]: Finished difference Result 11901 states and 58625 transitions. [2020-02-10 19:38:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:10,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:10,062 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 19:38:10,062 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 19:38:10,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 19:38:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6223. [2020-02-10 19:38:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:38:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34131 transitions. [2020-02-10 19:38:10,685 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34131 transitions. Word has length 34 [2020-02-10 19:38:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:10,685 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34131 transitions. [2020-02-10 19:38:10,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34131 transitions. [2020-02-10 19:38:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:10,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:10,696 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:10,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1069306874, now seen corresponding path program 144 times [2020-02-10 19:38:10,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:10,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461665196] [2020-02-10 19:38:10,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:11,243 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:11,391 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:11,537 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:11,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461665196] [2020-02-10 19:38:11,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:11,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:11,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78970127] [2020-02-10 19:38:11,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:11,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:11,549 INFO L87 Difference]: Start difference. First operand 6223 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:38:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:11,845 INFO L93 Difference]: Finished difference Result 11900 states and 58614 transitions. [2020-02-10 19:38:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:11,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:11,875 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:38:11,875 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 19:38:11,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 19:38:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6197. [2020-02-10 19:38:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 19:38:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34075 transitions. [2020-02-10 19:38:12,501 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34075 transitions. Word has length 34 [2020-02-10 19:38:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:12,501 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34075 transitions. [2020-02-10 19:38:12,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34075 transitions. [2020-02-10 19:38:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:12,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:12,512 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash -990534336, now seen corresponding path program 145 times [2020-02-10 19:38:12,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:12,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133274879] [2020-02-10 19:38:12,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:13,077 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:13,235 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:38:13,383 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:13,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133274879] [2020-02-10 19:38:13,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:13,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:13,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420136844] [2020-02-10 19:38:13,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:13,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:13,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:13,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:13,395 INFO L87 Difference]: Start difference. First operand 6197 states and 34075 transitions. Second operand 13 states. [2020-02-10 19:38:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:13,843 INFO L93 Difference]: Finished difference Result 11912 states and 58673 transitions. [2020-02-10 19:38:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:13,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:13,876 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 19:38:13,876 INFO L226 Difference]: Without dead ends: 11888 [2020-02-10 19:38:13,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2020-02-10 19:38:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 6227. [2020-02-10 19:38:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 19:38:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34169 transitions. [2020-02-10 19:38:14,498 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34169 transitions. Word has length 34 [2020-02-10 19:38:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:14,498 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34169 transitions. [2020-02-10 19:38:14,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34169 transitions. [2020-02-10 19:38:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:14,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:14,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:14,509 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1627001190, now seen corresponding path program 146 times [2020-02-10 19:38:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:14,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586670044] [2020-02-10 19:38:14,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:15,079 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:15,229 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:15,380 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:15,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586670044] [2020-02-10 19:38:15,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:15,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:15,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367357252] [2020-02-10 19:38:15,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:15,392 INFO L87 Difference]: Start difference. First operand 6227 states and 34169 transitions. Second operand 13 states. [2020-02-10 19:38:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:15,708 INFO L93 Difference]: Finished difference Result 11910 states and 58659 transitions. [2020-02-10 19:38:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:15,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:15,739 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 19:38:15,739 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 19:38:15,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 19:38:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6215. [2020-02-10 19:38:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:38:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34139 transitions. [2020-02-10 19:38:16,359 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34139 transitions. Word has length 34 [2020-02-10 19:38:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:16,359 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34139 transitions. [2020-02-10 19:38:16,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34139 transitions. [2020-02-10 19:38:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:16,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:16,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:16,370 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:16,371 INFO L82 PathProgramCache]: Analyzing trace with hash 772720368, now seen corresponding path program 147 times [2020-02-10 19:38:16,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:16,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634093037] [2020-02-10 19:38:16,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:16,925 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:38:17,069 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:38:17,220 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:17,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634093037] [2020-02-10 19:38:17,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:17,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:17,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445108820] [2020-02-10 19:38:17,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:17,233 INFO L87 Difference]: Start difference. First operand 6215 states and 34139 transitions. Second operand 13 states. [2020-02-10 19:38:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:17,653 INFO L93 Difference]: Finished difference Result 11900 states and 58639 transitions. [2020-02-10 19:38:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:17,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:17,683 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:38:17,683 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 19:38:17,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 19:38:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6223. [2020-02-10 19:38:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:38:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 19:38:18,307 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 19:38:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:18,307 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 19:38:18,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 19:38:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:18,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:18,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:18,318 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -212215916, now seen corresponding path program 148 times [2020-02-10 19:38:18,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:18,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672843879] [2020-02-10 19:38:18,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:19,024 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:38:19,173 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:19,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672843879] [2020-02-10 19:38:19,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:19,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:19,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063968598] [2020-02-10 19:38:19,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:19,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:19,283 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 19:38:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:19,531 INFO L93 Difference]: Finished difference Result 11905 states and 58641 transitions. [2020-02-10 19:38:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:19,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:19,569 INFO L225 Difference]: With dead ends: 11905 [2020-02-10 19:38:19,569 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 19:38:19,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 19:38:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6215. [2020-02-10 19:38:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:38:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 19:38:20,189 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 19:38:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:20,189 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 19:38:20,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 19:38:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:20,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:20,201 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1777882922, now seen corresponding path program 149 times [2020-02-10 19:38:20,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:20,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301436843] [2020-02-10 19:38:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:20,888 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:38:21,039 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:21,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301436843] [2020-02-10 19:38:21,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:21,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:21,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370226080] [2020-02-10 19:38:21,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:21,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:21,065 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:38:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:21,369 INFO L93 Difference]: Finished difference Result 11897 states and 58626 transitions. [2020-02-10 19:38:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:21,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:21,399 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 19:38:21,399 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 19:38:21,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 19:38:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6222. [2020-02-10 19:38:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:38:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 19:38:22,022 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 19:38:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:22,022 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 19:38:22,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 19:38:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:22,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:22,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:22,032 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1986345676, now seen corresponding path program 150 times [2020-02-10 19:38:22,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:22,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365100269] [2020-02-10 19:38:22,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:22,750 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:22,900 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:22,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365100269] [2020-02-10 19:38:22,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:22,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:22,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586017913] [2020-02-10 19:38:22,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:22,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:22,912 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 19:38:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:23,231 INFO L93 Difference]: Finished difference Result 11900 states and 58625 transitions. [2020-02-10 19:38:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:23,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:23,261 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:38:23,261 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 19:38:23,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 19:38:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6206. [2020-02-10 19:38:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:38:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34107 transitions. [2020-02-10 19:38:23,879 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34107 transitions. Word has length 34 [2020-02-10 19:38:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:23,879 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34107 transitions. [2020-02-10 19:38:23,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34107 transitions. [2020-02-10 19:38:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:23,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:23,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:23,891 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2087042548, now seen corresponding path program 151 times [2020-02-10 19:38:23,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:23,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812144997] [2020-02-10 19:38:23,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:24,463 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:24,714 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 19:38:24,857 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:24,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812144997] [2020-02-10 19:38:24,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:24,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:24,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794649288] [2020-02-10 19:38:24,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:24,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:24,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:24,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:24,870 INFO L87 Difference]: Start difference. First operand 6206 states and 34107 transitions. Second operand 13 states. [2020-02-10 19:38:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:25,197 INFO L93 Difference]: Finished difference Result 11916 states and 58676 transitions. [2020-02-10 19:38:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:25,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:25,227 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 19:38:25,227 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 19:38:25,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 19:38:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6228. [2020-02-10 19:38:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:38:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34164 transitions. [2020-02-10 19:38:25,851 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34164 transitions. Word has length 34 [2020-02-10 19:38:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:25,851 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34164 transitions. [2020-02-10 19:38:25,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34164 transitions. [2020-02-10 19:38:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:25,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:25,862 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1450575694, now seen corresponding path program 152 times [2020-02-10 19:38:25,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:25,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345110216] [2020-02-10 19:38:25,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:26,442 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:26,581 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:38:26,736 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:26,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345110216] [2020-02-10 19:38:26,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:26,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:26,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759500445] [2020-02-10 19:38:26,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:26,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:26,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:26,756 INFO L87 Difference]: Start difference. First operand 6228 states and 34164 transitions. Second operand 13 states. [2020-02-10 19:38:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:27,151 INFO L93 Difference]: Finished difference Result 11914 states and 58662 transitions. [2020-02-10 19:38:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:27,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:27,181 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 19:38:27,182 INFO L226 Difference]: Without dead ends: 11880 [2020-02-10 19:38:27,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11880 states. [2020-02-10 19:38:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11880 to 6216. [2020-02-10 19:38:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:38:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 19:38:27,803 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 19:38:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:27,803 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 19:38:27,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 19:38:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:27,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:27,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:27,814 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1733424308, now seen corresponding path program 153 times [2020-02-10 19:38:27,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:27,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072530535] [2020-02-10 19:38:27,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:28,373 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:38:28,524 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 19:38:28,675 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:28,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072530535] [2020-02-10 19:38:28,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:28,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:28,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123547859] [2020-02-10 19:38:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:28,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:28,688 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 19:38:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:29,153 INFO L93 Difference]: Finished difference Result 11911 states and 58655 transitions. [2020-02-10 19:38:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:29,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:29,207 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 19:38:29,208 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 19:38:29,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 19:38:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 19:38:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:38:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34149 transitions. [2020-02-10 19:38:30,014 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34149 transitions. Word has length 34 [2020-02-10 19:38:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:30,014 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34149 transitions. [2020-02-10 19:38:30,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34149 transitions. [2020-02-10 19:38:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:30,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:30,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:30,025 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 672646218, now seen corresponding path program 154 times [2020-02-10 19:38:30,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:30,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463255254] [2020-02-10 19:38:30,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:30,559 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:38:30,820 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:38:30,968 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:30,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463255254] [2020-02-10 19:38:30,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:30,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:30,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577100463] [2020-02-10 19:38:30,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:30,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:30,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:30,981 INFO L87 Difference]: Start difference. First operand 6225 states and 34149 transitions. Second operand 13 states. [2020-02-10 19:38:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:31,366 INFO L93 Difference]: Finished difference Result 11907 states and 58639 transitions. [2020-02-10 19:38:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:31,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:31,396 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 19:38:31,396 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 19:38:31,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 19:38:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6216. [2020-02-10 19:38:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:38:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34124 transitions. [2020-02-10 19:38:32,015 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34124 transitions. Word has length 34 [2020-02-10 19:38:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:32,015 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34124 transitions. [2020-02-10 19:38:32,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34124 transitions. [2020-02-10 19:38:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:32,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:32,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:32,026 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1453645836, now seen corresponding path program 155 times [2020-02-10 19:38:32,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:32,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802354855] [2020-02-10 19:38:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:32,727 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:38:32,873 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:32,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802354855] [2020-02-10 19:38:32,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:32,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:32,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744637717] [2020-02-10 19:38:32,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:32,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:32,885 INFO L87 Difference]: Start difference. First operand 6216 states and 34124 transitions. Second operand 13 states. [2020-02-10 19:38:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:33,212 INFO L93 Difference]: Finished difference Result 11906 states and 58638 transitions. [2020-02-10 19:38:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:33,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:33,241 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 19:38:33,241 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 19:38:33,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 19:38:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6224. [2020-02-10 19:38:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 19:38:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34139 transitions. [2020-02-10 19:38:33,866 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34139 transitions. Word has length 34 [2020-02-10 19:38:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:33,866 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34139 transitions. [2020-02-10 19:38:33,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34139 transitions. [2020-02-10 19:38:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:33,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:33,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:33,877 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1877957072, now seen corresponding path program 156 times [2020-02-10 19:38:33,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:33,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623461537] [2020-02-10 19:38:33,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:34,594 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:34,747 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:34,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623461537] [2020-02-10 19:38:34,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:34,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:34,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387849600] [2020-02-10 19:38:34,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:34,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:34,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:34,760 INFO L87 Difference]: Start difference. First operand 6224 states and 34139 transitions. Second operand 13 states. [2020-02-10 19:38:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:35,126 INFO L93 Difference]: Finished difference Result 11904 states and 58626 transitions. [2020-02-10 19:38:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:35,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:35,156 INFO L225 Difference]: With dead ends: 11904 [2020-02-10 19:38:35,156 INFO L226 Difference]: Without dead ends: 11866 [2020-02-10 19:38:35,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11866 states. [2020-02-10 19:38:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11866 to 6206. [2020-02-10 19:38:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:38:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 19:38:35,774 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 19:38:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:35,774 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 19:38:35,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 19:38:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:35,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:35,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:35,785 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1599510480, now seen corresponding path program 157 times [2020-02-10 19:38:35,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:35,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925966721] [2020-02-10 19:38:35,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:36,060 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 19:38:36,444 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:38:36,586 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:38:36,734 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:36,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925966721] [2020-02-10 19:38:36,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:36,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:36,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730493482] [2020-02-10 19:38:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:36,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:36,747 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 19:38:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:37,240 INFO L93 Difference]: Finished difference Result 11894 states and 58617 transitions. [2020-02-10 19:38:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:37,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:37,269 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 19:38:37,269 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 19:38:37,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 19:38:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6222. [2020-02-10 19:38:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:38:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34143 transitions. [2020-02-10 19:38:37,900 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34143 transitions. Word has length 34 [2020-02-10 19:38:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:37,900 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34143 transitions. [2020-02-10 19:38:37,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34143 transitions. [2020-02-10 19:38:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:37,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:37,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:37,911 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1710520532, now seen corresponding path program 158 times [2020-02-10 19:38:37,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:37,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732145088] [2020-02-10 19:38:37,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:38,471 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:38:38,618 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:38:38,773 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:38,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732145088] [2020-02-10 19:38:38,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:38,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:38,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372687452] [2020-02-10 19:38:38,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:38,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:38,784 INFO L87 Difference]: Start difference. First operand 6222 states and 34143 transitions. Second operand 13 states. [2020-02-10 19:38:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:39,037 INFO L93 Difference]: Finished difference Result 11899 states and 58619 transitions. [2020-02-10 19:38:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:39,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:39,066 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 19:38:39,066 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 19:38:39,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 19:38:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 19:38:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:38:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34120 transitions. [2020-02-10 19:38:39,684 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34120 transitions. Word has length 34 [2020-02-10 19:38:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:39,684 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34120 transitions. [2020-02-10 19:38:39,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34120 transitions. [2020-02-10 19:38:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:39,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:39,695 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -123892902, now seen corresponding path program 159 times [2020-02-10 19:38:39,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:39,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944603374] [2020-02-10 19:38:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:40,248 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:38:40,389 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:38:40,535 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:38:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:40,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944603374] [2020-02-10 19:38:40,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:40,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:40,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332419819] [2020-02-10 19:38:40,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:40,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:40,548 INFO L87 Difference]: Start difference. First operand 6214 states and 34120 transitions. Second operand 13 states. [2020-02-10 19:38:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:40,865 INFO L93 Difference]: Finished difference Result 11889 states and 58600 transitions. [2020-02-10 19:38:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:40,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:40,895 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 19:38:40,895 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 19:38:40,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 19:38:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6221. [2020-02-10 19:38:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:38:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34133 transitions. [2020-02-10 19:38:41,522 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34133 transitions. Word has length 34 [2020-02-10 19:38:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:41,522 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34133 transitions. [2020-02-10 19:38:41,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34133 transitions. [2020-02-10 19:38:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:41,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:41,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:41,533 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1176487028, now seen corresponding path program 160 times [2020-02-10 19:38:41,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358778262] [2020-02-10 19:38:41,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:42,173 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:38:42,317 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:38:42,468 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:42,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358778262] [2020-02-10 19:38:42,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:42,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:42,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138901816] [2020-02-10 19:38:42,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:42,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:42,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:42,480 INFO L87 Difference]: Start difference. First operand 6221 states and 34133 transitions. Second operand 13 states. [2020-02-10 19:38:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:42,773 INFO L93 Difference]: Finished difference Result 11890 states and 58595 transitions. [2020-02-10 19:38:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:42,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:42,802 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 19:38:42,803 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 19:38:42,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 19:38:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6214. [2020-02-10 19:38:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:38:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34113 transitions. [2020-02-10 19:38:43,424 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34113 transitions. Word has length 34 [2020-02-10 19:38:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:43,424 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34113 transitions. [2020-02-10 19:38:43,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34113 transitions. [2020-02-10 19:38:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:43,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:43,436 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash -927374598, now seen corresponding path program 161 times [2020-02-10 19:38:43,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:43,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60862258] [2020-02-10 19:38:43,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:44,129 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 19:38:44,279 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:44,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60862258] [2020-02-10 19:38:44,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:44,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716482812] [2020-02-10 19:38:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:44,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:44,291 INFO L87 Difference]: Start difference. First operand 6214 states and 34113 transitions. Second operand 13 states. [2020-02-10 19:38:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:44,537 INFO L93 Difference]: Finished difference Result 11901 states and 58616 transitions. [2020-02-10 19:38:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:44,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:44,568 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 19:38:44,568 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 19:38:44,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 19:38:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 19:38:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:38:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34129 transitions. [2020-02-10 19:38:45,187 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34129 transitions. Word has length 34 [2020-02-10 19:38:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:45,187 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34129 transitions. [2020-02-10 19:38:45,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34129 transitions. [2020-02-10 19:38:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:45,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:45,198 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1675843802, now seen corresponding path program 162 times [2020-02-10 19:38:45,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:45,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14640033] [2020-02-10 19:38:45,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:45,899 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:38:46,053 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:46,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14640033] [2020-02-10 19:38:46,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:46,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:46,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532805538] [2020-02-10 19:38:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:46,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:46,064 INFO L87 Difference]: Start difference. First operand 6223 states and 34129 transitions. Second operand 13 states. [2020-02-10 19:38:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:46,416 INFO L93 Difference]: Finished difference Result 11897 states and 58600 transitions. [2020-02-10 19:38:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:46,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:46,446 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 19:38:46,446 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:38:46,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:38:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6206. [2020-02-10 19:38:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 19:38:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34090 transitions. [2020-02-10 19:38:47,064 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34090 transitions. Word has length 34 [2020-02-10 19:38:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:47,064 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34090 transitions. [2020-02-10 19:38:47,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34090 transitions. [2020-02-10 19:38:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:47,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:47,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:47,170 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1614437136, now seen corresponding path program 163 times [2020-02-10 19:38:47,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:47,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241776209] [2020-02-10 19:38:47,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:47,858 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:38:48,010 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241776209] [2020-02-10 19:38:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763032843] [2020-02-10 19:38:48,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:48,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:48,023 INFO L87 Difference]: Start difference. First operand 6206 states and 34090 transitions. Second operand 13 states. [2020-02-10 19:38:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:48,327 INFO L93 Difference]: Finished difference Result 11886 states and 58594 transitions. [2020-02-10 19:38:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:48,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:48,357 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 19:38:48,357 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 19:38:48,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 19:38:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 19:38:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:38:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34130 transitions. [2020-02-10 19:38:48,983 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34130 transitions. Word has length 34 [2020-02-10 19:38:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:48,983 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34130 transitions. [2020-02-10 19:38:48,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34130 transitions. [2020-02-10 19:38:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:48,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:48,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:48,995 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1822899890, now seen corresponding path program 164 times [2020-02-10 19:38:48,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:48,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885659758] [2020-02-10 19:38:48,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:49,672 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:49,825 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:49,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885659758] [2020-02-10 19:38:49,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:49,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:49,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855426539] [2020-02-10 19:38:49,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:49,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:49,836 INFO L87 Difference]: Start difference. First operand 6220 states and 34130 transitions. Second operand 13 states. [2020-02-10 19:38:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:50,138 INFO L93 Difference]: Finished difference Result 11889 states and 58593 transitions. [2020-02-10 19:38:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:50,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:50,168 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 19:38:50,168 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:38:50,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:38:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 19:38:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:38:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34110 transitions. [2020-02-10 19:38:50,785 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34110 transitions. Word has length 34 [2020-02-10 19:38:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:50,786 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34110 transitions. [2020-02-10 19:38:50,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34110 transitions. [2020-02-10 19:38:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:50,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:50,797 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1883183564, now seen corresponding path program 165 times [2020-02-10 19:38:50,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:50,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94651506] [2020-02-10 19:38:50,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:51,359 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:51,502 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:38:51,654 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:51,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94651506] [2020-02-10 19:38:51,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:51,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:51,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612627476] [2020-02-10 19:38:51,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:51,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:51,666 INFO L87 Difference]: Start difference. First operand 6213 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:38:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:51,967 INFO L93 Difference]: Finished difference Result 11884 states and 58583 transitions. [2020-02-10 19:38:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:51,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:51,997 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:38:51,997 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 19:38:51,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 19:38:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6220. [2020-02-10 19:38:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:38:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34123 transitions. [2020-02-10 19:38:52,619 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34123 transitions. Word has length 34 [2020-02-10 19:38:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:52,619 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34123 transitions. [2020-02-10 19:38:52,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34123 transitions. [2020-02-10 19:38:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:52,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:52,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:52,722 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash -582803634, now seen corresponding path program 166 times [2020-02-10 19:38:52,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:52,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319799037] [2020-02-10 19:38:52,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:53,408 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:53,562 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:53,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319799037] [2020-02-10 19:38:53,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:53,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:53,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499271956] [2020-02-10 19:38:53,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:53,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:53,574 INFO L87 Difference]: Start difference. First operand 6220 states and 34123 transitions. Second operand 13 states. [2020-02-10 19:38:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:53,882 INFO L93 Difference]: Finished difference Result 11885 states and 58578 transitions. [2020-02-10 19:38:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:53,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:53,914 INFO L225 Difference]: With dead ends: 11885 [2020-02-10 19:38:53,914 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 19:38:53,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 19:38:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6213. [2020-02-10 19:38:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:38:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34103 transitions. [2020-02-10 19:38:54,547 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34103 transitions. Word has length 34 [2020-02-10 19:38:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:54,547 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34103 transitions. [2020-02-10 19:38:54,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34103 transitions. [2020-02-10 19:38:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:54,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:54,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:54,558 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:54,559 INFO L82 PathProgramCache]: Analyzing trace with hash -165827724, now seen corresponding path program 167 times [2020-02-10 19:38:54,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:54,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137791785] [2020-02-10 19:38:54,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:55,261 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:38:55,410 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:55,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137791785] [2020-02-10 19:38:55,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:55,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:55,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133911198] [2020-02-10 19:38:55,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:55,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:55,422 INFO L87 Difference]: Start difference. First operand 6213 states and 34103 transitions. Second operand 13 states. [2020-02-10 19:38:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:55,848 INFO L93 Difference]: Finished difference Result 11891 states and 58591 transitions. [2020-02-10 19:38:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:55,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:55,879 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 19:38:55,879 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 19:38:55,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 19:38:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 19:38:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:38:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34118 transitions. [2020-02-10 19:38:56,503 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34118 transitions. Word has length 34 [2020-02-10 19:38:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:56,504 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34118 transitions. [2020-02-10 19:38:56,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34118 transitions. [2020-02-10 19:38:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:56,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:56,515 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1544785584, now seen corresponding path program 168 times [2020-02-10 19:38:56,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:56,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471673265] [2020-02-10 19:38:56,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:57,199 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:38:57,352 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:38:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:57,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471673265] [2020-02-10 19:38:57,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:57,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:57,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169513380] [2020-02-10 19:38:57,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:57,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:57,363 INFO L87 Difference]: Start difference. First operand 6221 states and 34118 transitions. Second operand 13 states. [2020-02-10 19:38:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:57,692 INFO L93 Difference]: Finished difference Result 11889 states and 58579 transitions. [2020-02-10 19:38:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:57,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:57,722 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 19:38:57,723 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 19:38:57,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:38:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 19:38:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6197. [2020-02-10 19:38:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 19:38:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34066 transitions. [2020-02-10 19:38:58,484 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34066 transitions. Word has length 34 [2020-02-10 19:38:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:58,485 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34066 transitions. [2020-02-10 19:38:58,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:38:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34066 transitions. [2020-02-10 19:38:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:38:58,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:58,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:58,496 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -834520410, now seen corresponding path program 169 times [2020-02-10 19:38:58,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:58,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668634434] [2020-02-10 19:38:58,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:59,069 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:59,216 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 19:38:59,363 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:38:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:59,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668634434] [2020-02-10 19:38:59,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:59,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:38:59,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164448754] [2020-02-10 19:38:59,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:38:59,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:38:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:59,375 INFO L87 Difference]: Start difference. First operand 6197 states and 34066 transitions. Second operand 13 states. [2020-02-10 19:38:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:59,649 INFO L93 Difference]: Finished difference Result 11931 states and 58720 transitions. [2020-02-10 19:38:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:38:59,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:38:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:59,681 INFO L225 Difference]: With dead ends: 11931 [2020-02-10 19:38:59,681 INFO L226 Difference]: Without dead ends: 11907 [2020-02-10 19:38:59,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11907 states. [2020-02-10 19:39:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11907 to 6231. [2020-02-10 19:39:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 19:39:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34172 transitions. [2020-02-10 19:39:00,303 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34172 transitions. Word has length 34 [2020-02-10 19:39:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:00,303 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34172 transitions. [2020-02-10 19:39:00,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34172 transitions. [2020-02-10 19:39:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:00,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:00,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:00,315 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1470987264, now seen corresponding path program 170 times [2020-02-10 19:39:00,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:00,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641900] [2020-02-10 19:39:00,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:00,993 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:39:01,139 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:01,290 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:01,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641900] [2020-02-10 19:39:01,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:01,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:01,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375132804] [2020-02-10 19:39:01,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:01,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:01,303 INFO L87 Difference]: Start difference. First operand 6231 states and 34172 transitions. Second operand 13 states. [2020-02-10 19:39:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:01,612 INFO L93 Difference]: Finished difference Result 11929 states and 58706 transitions. [2020-02-10 19:39:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:01,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:01,641 INFO L225 Difference]: With dead ends: 11929 [2020-02-10 19:39:01,642 INFO L226 Difference]: Without dead ends: 11895 [2020-02-10 19:39:01,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11895 states. [2020-02-10 19:39:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11895 to 6219. [2020-02-10 19:39:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:39:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34141 transitions. [2020-02-10 19:39:02,261 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34141 transitions. Word has length 34 [2020-02-10 19:39:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:02,261 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34141 transitions. [2020-02-10 19:39:02,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34141 transitions. [2020-02-10 19:39:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:02,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:02,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:02,272 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1188138650, now seen corresponding path program 171 times [2020-02-10 19:39:02,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:02,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318586585] [2020-02-10 19:39:02,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:02,989 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 19:39:03,138 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:03,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318586585] [2020-02-10 19:39:03,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:03,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:03,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173731891] [2020-02-10 19:39:03,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:03,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:03,150 INFO L87 Difference]: Start difference. First operand 6219 states and 34141 transitions. Second operand 13 states. [2020-02-10 19:39:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:03,429 INFO L93 Difference]: Finished difference Result 11926 states and 58699 transitions. [2020-02-10 19:39:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:03,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:03,459 INFO L225 Difference]: With dead ends: 11926 [2020-02-10 19:39:03,459 INFO L226 Difference]: Without dead ends: 11902 [2020-02-10 19:39:03,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2020-02-10 19:39:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6228. [2020-02-10 19:39:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:39:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34157 transitions. [2020-02-10 19:39:04,226 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34157 transitions. Word has length 34 [2020-02-10 19:39:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:04,226 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34157 transitions. [2020-02-10 19:39:04,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34157 transitions. [2020-02-10 19:39:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:04,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:04,238 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2046050556, now seen corresponding path program 172 times [2020-02-10 19:39:04,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:04,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641502946] [2020-02-10 19:39:04,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:04,947 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:39:05,093 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:05,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641502946] [2020-02-10 19:39:05,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:05,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:05,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510328831] [2020-02-10 19:39:05,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:05,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:05,106 INFO L87 Difference]: Start difference. First operand 6228 states and 34157 transitions. Second operand 13 states. [2020-02-10 19:39:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:05,416 INFO L93 Difference]: Finished difference Result 11922 states and 58683 transitions. [2020-02-10 19:39:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:05,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:05,445 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 19:39:05,445 INFO L226 Difference]: Without dead ends: 11893 [2020-02-10 19:39:05,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2020-02-10 19:39:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 6219. [2020-02-10 19:39:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:39:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34132 transitions. [2020-02-10 19:39:06,066 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34132 transitions. Word has length 34 [2020-02-10 19:39:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:06,066 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34132 transitions. [2020-02-10 19:39:06,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34132 transitions. [2020-02-10 19:39:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:06,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:06,077 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash -80241498, now seen corresponding path program 173 times [2020-02-10 19:39:06,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:06,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241896460] [2020-02-10 19:39:06,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:06,783 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:06,933 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:06,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 19:39:06,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241896460] [2020-02-10 19:39:06,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:06,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:06,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211542416] [2020-02-10 19:39:06,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:06,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:06,946 INFO L87 Difference]: Start difference. First operand 6219 states and 34132 transitions. Second operand 13 states. [2020-02-10 19:39:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:07,368 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 19:39:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:07,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:07,397 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 19:39:07,398 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 19:39:07,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 19:39:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6227. [2020-02-10 19:39:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 19:39:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34147 transitions. [2020-02-10 19:39:08,019 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34147 transitions. Word has length 34 [2020-02-10 19:39:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:08,020 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34147 transitions. [2020-02-10 19:39:08,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34147 transitions. [2020-02-10 19:39:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:08,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:08,031 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash -504552734, now seen corresponding path program 174 times [2020-02-10 19:39:08,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:08,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68613512] [2020-02-10 19:39:08,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:08,734 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:08,888 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:08,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68613512] [2020-02-10 19:39:08,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:08,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:08,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825842794] [2020-02-10 19:39:08,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:08,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:08,900 INFO L87 Difference]: Start difference. First operand 6227 states and 34147 transitions. Second operand 13 states. [2020-02-10 19:39:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:09,269 INFO L93 Difference]: Finished difference Result 11919 states and 58670 transitions. [2020-02-10 19:39:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:09,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:09,300 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 19:39:09,300 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 19:39:09,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 19:39:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6209. [2020-02-10 19:39:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:39:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34105 transitions. [2020-02-10 19:39:10,055 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34105 transitions. Word has length 34 [2020-02-10 19:39:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:10,055 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34105 transitions. [2020-02-10 19:39:10,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34105 transitions. [2020-02-10 19:39:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:10,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:10,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:10,066 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 704268032, now seen corresponding path program 175 times [2020-02-10 19:39:10,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:10,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919407921] [2020-02-10 19:39:10,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:10,639 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:10,795 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-02-10 19:39:10,947 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-02-10 19:39:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:10,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919407921] [2020-02-10 19:39:10,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:10,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:10,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343054492] [2020-02-10 19:39:10,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:10,959 INFO L87 Difference]: Start difference. First operand 6209 states and 34105 transitions. Second operand 13 states. [2020-02-10 19:39:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:11,289 INFO L93 Difference]: Finished difference Result 11936 states and 58723 transitions. [2020-02-10 19:39:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:11,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:11,319 INFO L225 Difference]: With dead ends: 11936 [2020-02-10 19:39:11,319 INFO L226 Difference]: Without dead ends: 11912 [2020-02-10 19:39:11,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11912 states. [2020-02-10 19:39:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11912 to 6233. [2020-02-10 19:39:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6233 states. [2020-02-10 19:39:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 34167 transitions. [2020-02-10 19:39:11,941 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 34167 transitions. Word has length 34 [2020-02-10 19:39:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:11,941 INFO L479 AbstractCegarLoop]: Abstraction has 6233 states and 34167 transitions. [2020-02-10 19:39:11,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 34167 transitions. [2020-02-10 19:39:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:11,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:11,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:11,952 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 67801178, now seen corresponding path program 176 times [2020-02-10 19:39:11,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:11,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300584765] [2020-02-10 19:39:11,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:12,516 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:12,660 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:12,810 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 19:39:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:12,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300584765] [2020-02-10 19:39:12,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:12,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058075203] [2020-02-10 19:39:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:12,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:12,823 INFO L87 Difference]: Start difference. First operand 6233 states and 34167 transitions. Second operand 13 states. [2020-02-10 19:39:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:13,181 INFO L93 Difference]: Finished difference Result 11934 states and 58709 transitions. [2020-02-10 19:39:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:13,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:13,211 INFO L225 Difference]: With dead ends: 11934 [2020-02-10 19:39:13,211 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 19:39:13,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 19:39:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6221. [2020-02-10 19:39:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:39:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34135 transitions. [2020-02-10 19:39:13,831 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34135 transitions. Word has length 34 [2020-02-10 19:39:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:13,831 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34135 transitions. [2020-02-10 19:39:13,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34135 transitions. [2020-02-10 19:39:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:13,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:13,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:13,842 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1632287462, now seen corresponding path program 177 times [2020-02-10 19:39:13,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:13,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496993712] [2020-02-10 19:39:13,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:14,414 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:14,565 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 19:39:14,712 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:14,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496993712] [2020-02-10 19:39:14,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:14,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:14,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374070082] [2020-02-10 19:39:14,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:14,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:14,724 INFO L87 Difference]: Start difference. First operand 6221 states and 34135 transitions. Second operand 13 states. [2020-02-10 19:39:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:15,087 INFO L93 Difference]: Finished difference Result 11933 states and 58706 transitions. [2020-02-10 19:39:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:15,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:15,122 INFO L225 Difference]: With dead ends: 11933 [2020-02-10 19:39:15,122 INFO L226 Difference]: Without dead ends: 11909 [2020-02-10 19:39:15,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11909 states. [2020-02-10 19:39:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11909 to 6231. [2020-02-10 19:39:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 19:39:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34153 transitions. [2020-02-10 19:39:15,864 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34153 transitions. Word has length 34 [2020-02-10 19:39:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:15,864 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34153 transitions. [2020-02-10 19:39:15,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34153 transitions. [2020-02-10 19:39:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:15,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:15,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:15,876 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -64957482, now seen corresponding path program 178 times [2020-02-10 19:39:15,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:15,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528007546] [2020-02-10 19:39:15,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:16,447 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:16,590 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:16,733 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:16,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528007546] [2020-02-10 19:39:16,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:16,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:16,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938630989] [2020-02-10 19:39:16,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:16,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:16,746 INFO L87 Difference]: Start difference. First operand 6231 states and 34153 transitions. Second operand 13 states. [2020-02-10 19:39:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:17,125 INFO L93 Difference]: Finished difference Result 11930 states and 58691 transitions. [2020-02-10 19:39:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:17,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:17,155 INFO L225 Difference]: With dead ends: 11930 [2020-02-10 19:39:17,156 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 19:39:17,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 19:39:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6221. [2020-02-10 19:39:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:39:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34125 transitions. [2020-02-10 19:39:17,776 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34125 transitions. Word has length 34 [2020-02-10 19:39:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:17,776 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34125 transitions. [2020-02-10 19:39:17,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34125 transitions. [2020-02-10 19:39:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:17,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:17,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:17,787 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1554782682, now seen corresponding path program 179 times [2020-02-10 19:39:17,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:17,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690370200] [2020-02-10 19:39:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:18,368 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:18,509 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:18,659 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 19:39:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:18,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690370200] [2020-02-10 19:39:18,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:18,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:18,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100215818] [2020-02-10 19:39:18,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:18,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:18,671 INFO L87 Difference]: Start difference. First operand 6221 states and 34125 transitions. Second operand 13 states. [2020-02-10 19:39:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:19,008 INFO L93 Difference]: Finished difference Result 11928 states and 58688 transitions. [2020-02-10 19:39:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:19,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:19,038 INFO L225 Difference]: With dead ends: 11928 [2020-02-10 19:39:19,038 INFO L226 Difference]: Without dead ends: 11906 [2020-02-10 19:39:19,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2020-02-10 19:39:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 6230. [2020-02-10 19:39:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2020-02-10 19:39:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 34142 transitions. [2020-02-10 19:39:19,656 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 34142 transitions. Word has length 34 [2020-02-10 19:39:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:19,656 INFO L479 AbstractCegarLoop]: Abstraction has 6230 states and 34142 transitions. [2020-02-10 19:39:19,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 34142 transitions. [2020-02-10 19:39:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:19,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:19,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:19,667 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1679406524, now seen corresponding path program 180 times [2020-02-10 19:39:19,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:19,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547654676] [2020-02-10 19:39:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:20,246 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:20,390 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:20,537 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:39:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:20,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547654676] [2020-02-10 19:39:20,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:20,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:20,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255539873] [2020-02-10 19:39:20,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:20,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:20,549 INFO L87 Difference]: Start difference. First operand 6230 states and 34142 transitions. Second operand 13 states. [2020-02-10 19:39:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:20,851 INFO L93 Difference]: Finished difference Result 11927 states and 58677 transitions. [2020-02-10 19:39:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:20,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:20,880 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 19:39:20,881 INFO L226 Difference]: Without dead ends: 11885 [2020-02-10 19:39:20,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2020-02-10 19:39:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 6209. [2020-02-10 19:39:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:39:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34094 transitions. [2020-02-10 19:39:21,616 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34094 transitions. Word has length 34 [2020-02-10 19:39:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:21,616 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34094 transitions. [2020-02-10 19:39:21,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34094 transitions. [2020-02-10 19:39:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:21,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:21,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:21,627 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1810659904, now seen corresponding path program 181 times [2020-02-10 19:39:21,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:21,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450571260] [2020-02-10 19:39:21,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:22,190 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:22,344 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 19:39:22,494 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:22,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450571260] [2020-02-10 19:39:22,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:22,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:22,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678223914] [2020-02-10 19:39:22,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:22,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:22,507 INFO L87 Difference]: Start difference. First operand 6209 states and 34094 transitions. Second operand 13 states. [2020-02-10 19:39:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:22,758 INFO L93 Difference]: Finished difference Result 11922 states and 58680 transitions. [2020-02-10 19:39:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:22,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:22,789 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 19:39:22,789 INFO L226 Difference]: Without dead ends: 11898 [2020-02-10 19:39:22,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11898 states. [2020-02-10 19:39:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11898 to 6227. [2020-02-10 19:39:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 19:39:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34144 transitions. [2020-02-10 19:39:23,409 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34144 transitions. Word has length 34 [2020-02-10 19:39:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:23,410 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34144 transitions. [2020-02-10 19:39:23,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34144 transitions. [2020-02-10 19:39:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:23,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:23,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:23,421 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 749881814, now seen corresponding path program 182 times [2020-02-10 19:39:23,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:23,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712690866] [2020-02-10 19:39:23,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:23,985 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:24,131 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:24,288 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:24,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712690866] [2020-02-10 19:39:24,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:24,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636444719] [2020-02-10 19:39:24,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:24,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:24,300 INFO L87 Difference]: Start difference. First operand 6227 states and 34144 transitions. Second operand 13 states. [2020-02-10 19:39:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:24,597 INFO L93 Difference]: Finished difference Result 11918 states and 58664 transitions. [2020-02-10 19:39:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:24,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:24,626 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 19:39:24,626 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 19:39:24,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 19:39:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6218. [2020-02-10 19:39:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:39:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34119 transitions. [2020-02-10 19:39:25,264 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34119 transitions. Word has length 34 [2020-02-10 19:39:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:25,265 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34119 transitions. [2020-02-10 19:39:25,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34119 transitions. [2020-02-10 19:39:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:25,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:25,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:25,277 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -739943386, now seen corresponding path program 183 times [2020-02-10 19:39:25,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:25,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245399398] [2020-02-10 19:39:25,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:25,857 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:26,011 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 19:39:26,160 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:26,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245399398] [2020-02-10 19:39:26,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:26,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:26,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849464903] [2020-02-10 19:39:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:26,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:26,173 INFO L87 Difference]: Start difference. First operand 6218 states and 34119 transitions. Second operand 13 states. [2020-02-10 19:39:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:26,435 INFO L93 Difference]: Finished difference Result 11924 states and 58676 transitions. [2020-02-10 19:39:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:26,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:26,465 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 19:39:26,465 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 19:39:26,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 19:39:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6228. [2020-02-10 19:39:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 19:39:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34137 transitions. [2020-02-10 19:39:27,236 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34137 transitions. Word has length 34 [2020-02-10 19:39:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:27,236 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34137 transitions. [2020-02-10 19:39:27,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34137 transitions. [2020-02-10 19:39:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:27,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:27,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:27,248 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1857778966, now seen corresponding path program 184 times [2020-02-10 19:39:27,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:27,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332275791] [2020-02-10 19:39:27,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:27,819 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:27,961 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:28,112 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:28,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332275791] [2020-02-10 19:39:28,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:28,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:28,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105649369] [2020-02-10 19:39:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:28,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:28,125 INFO L87 Difference]: Start difference. First operand 6228 states and 34137 transitions. Second operand 13 states. [2020-02-10 19:39:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:28,503 INFO L93 Difference]: Finished difference Result 11921 states and 58661 transitions. [2020-02-10 19:39:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:28,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:28,532 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 19:39:28,532 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 19:39:28,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 19:39:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6218. [2020-02-10 19:39:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:39:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 19:39:29,159 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 19:39:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:29,159 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 19:39:29,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 19:39:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:29,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:29,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:29,169 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -325103898, now seen corresponding path program 185 times [2020-02-10 19:39:29,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:29,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766341559] [2020-02-10 19:39:29,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:29,734 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:29,875 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:30,027 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:30,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766341559] [2020-02-10 19:39:30,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:30,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:30,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83794491] [2020-02-10 19:39:30,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:30,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:30,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:30,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:30,040 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:39:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:30,363 INFO L93 Difference]: Finished difference Result 11914 states and 58648 transitions. [2020-02-10 19:39:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:30,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:30,393 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 19:39:30,393 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 19:39:30,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 19:39:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6226. [2020-02-10 19:39:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 19:39:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 19:39:31,013 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 19:39:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:31,013 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 19:39:31,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 19:39:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:31,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:31,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:31,025 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash -961570752, now seen corresponding path program 186 times [2020-02-10 19:39:31,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:31,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74116165] [2020-02-10 19:39:31,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:31,595 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:31,741 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:31,891 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:31,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74116165] [2020-02-10 19:39:31,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:31,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:31,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108881811] [2020-02-10 19:39:31,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:31,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:31,903 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 19:39:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:32,277 INFO L93 Difference]: Finished difference Result 11915 states and 58642 transitions. [2020-02-10 19:39:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:32,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:32,306 INFO L225 Difference]: With dead ends: 11915 [2020-02-10 19:39:32,307 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 19:39:32,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 19:39:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6209. [2020-02-10 19:39:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:39:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34085 transitions. [2020-02-10 19:39:32,929 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34085 transitions. Word has length 34 [2020-02-10 19:39:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:32,929 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34085 transitions. [2020-02-10 19:39:32,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34085 transitions. [2020-02-10 19:39:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:33,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:33,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:33,050 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1159266394, now seen corresponding path program 187 times [2020-02-10 19:39:33,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:33,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341499181] [2020-02-10 19:39:33,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:33,755 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:33,903 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341499181] [2020-02-10 19:39:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917963704] [2020-02-10 19:39:33,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:33,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:33,915 INFO L87 Difference]: Start difference. First operand 6209 states and 34085 transitions. Second operand 13 states. [2020-02-10 19:39:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:34,225 INFO L93 Difference]: Finished difference Result 11912 states and 58653 transitions. [2020-02-10 19:39:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:34,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:34,255 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 19:39:34,256 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 19:39:34,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 19:39:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6225. [2020-02-10 19:39:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:39:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34131 transitions. [2020-02-10 19:39:34,874 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34131 transitions. Word has length 34 [2020-02-10 19:39:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:34,874 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34131 transitions. [2020-02-10 19:39:34,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34131 transitions. [2020-02-10 19:39:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:34,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:34,885 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 734955158, now seen corresponding path program 188 times [2020-02-10 19:39:34,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:34,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377882243] [2020-02-10 19:39:34,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:35,598 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:35,748 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:35,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377882243] [2020-02-10 19:39:35,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:35,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:35,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003674153] [2020-02-10 19:39:35,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:35,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:35,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:35,761 INFO L87 Difference]: Start difference. First operand 6225 states and 34131 transitions. Second operand 13 states. [2020-02-10 19:39:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:36,112 INFO L93 Difference]: Finished difference Result 11910 states and 58641 transitions. [2020-02-10 19:39:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:36,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:36,141 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 19:39:36,141 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 19:39:36,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 19:39:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6217. [2020-02-10 19:39:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:39:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34108 transitions. [2020-02-10 19:39:36,765 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34108 transitions. Word has length 34 [2020-02-10 19:39:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:36,765 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34108 transitions. [2020-02-10 19:39:36,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34108 transitions. [2020-02-10 19:39:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:36,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:36,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:36,776 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1391336896, now seen corresponding path program 189 times [2020-02-10 19:39:36,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:36,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812170530] [2020-02-10 19:39:36,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:37,341 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:37,489 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:39:37,640 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 19:39:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:37,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812170530] [2020-02-10 19:39:37,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:37,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:37,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811142539] [2020-02-10 19:39:37,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:37,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:37,653 INFO L87 Difference]: Start difference. First operand 6217 states and 34108 transitions. Second operand 13 states. [2020-02-10 19:39:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:37,983 INFO L93 Difference]: Finished difference Result 11914 states and 58650 transitions. [2020-02-10 19:39:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:37,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:38,013 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 19:39:38,013 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 19:39:38,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 19:39:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6226. [2020-02-10 19:39:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 19:39:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 19:39:38,634 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 19:39:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:38,634 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 19:39:38,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 19:39:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:38,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:38,645 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1842852310, now seen corresponding path program 190 times [2020-02-10 19:39:38,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:38,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84023333] [2020-02-10 19:39:38,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:38,924 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 19:39:39,318 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:39,470 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:39,618 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:39:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:39,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84023333] [2020-02-10 19:39:39,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:39,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:39,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646839122] [2020-02-10 19:39:39,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:39,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:39,631 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 19:39:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:39,960 INFO L93 Difference]: Finished difference Result 11913 states and 58639 transitions. [2020-02-10 19:39:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:39,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:39,990 INFO L225 Difference]: With dead ends: 11913 [2020-02-10 19:39:39,991 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 19:39:39,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 19:39:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6217. [2020-02-10 19:39:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:39:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34100 transitions. [2020-02-10 19:39:40,615 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34100 transitions. Word has length 34 [2020-02-10 19:39:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:40,615 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34100 transitions. [2020-02-10 19:39:40,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34100 transitions. [2020-02-10 19:39:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:40,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:40,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:40,627 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2084394560, now seen corresponding path program 191 times [2020-02-10 19:39:40,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:40,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374085863] [2020-02-10 19:39:40,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:41,193 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:41,335 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:41,489 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 19:39:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:41,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374085863] [2020-02-10 19:39:41,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:41,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:41,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003431198] [2020-02-10 19:39:41,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:41,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:41,501 INFO L87 Difference]: Start difference. First operand 6217 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:39:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:41,833 INFO L93 Difference]: Finished difference Result 11909 states and 58631 transitions. [2020-02-10 19:39:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:41,833 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:41,863 INFO L225 Difference]: With dead ends: 11909 [2020-02-10 19:39:41,863 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 19:39:41,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 19:39:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6225. [2020-02-10 19:39:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 19:39:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34115 transitions. [2020-02-10 19:39:42,478 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34115 transitions. Word has length 34 [2020-02-10 19:39:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:42,478 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34115 transitions. [2020-02-10 19:39:42,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34115 transitions. [2020-02-10 19:39:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:42,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:42,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:42,489 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1574105882, now seen corresponding path program 192 times [2020-02-10 19:39:42,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:42,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898337653] [2020-02-10 19:39:42,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:43,055 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:43,200 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:39:43,350 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:39:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:43,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898337653] [2020-02-10 19:39:43,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:43,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:43,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249717044] [2020-02-10 19:39:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:43,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:43,362 INFO L87 Difference]: Start difference. First operand 6225 states and 34115 transitions. Second operand 13 states. [2020-02-10 19:39:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:43,678 INFO L93 Difference]: Finished difference Result 11910 states and 58625 transitions. [2020-02-10 19:39:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:43,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:43,708 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 19:39:43,708 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 19:39:43,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 19:39:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6197. [2020-02-10 19:39:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 19:39:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34055 transitions. [2020-02-10 19:39:44,336 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34055 transitions. Word has length 34 [2020-02-10 19:39:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:44,336 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34055 transitions. [2020-02-10 19:39:44,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34055 transitions. [2020-02-10 19:39:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:44,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:44,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:44,348 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1168931478, now seen corresponding path program 193 times [2020-02-10 19:39:44,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:44,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702474555] [2020-02-10 19:39:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:44,699 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-02-10 19:39:45,008 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:45,150 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:45,299 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:45,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702474555] [2020-02-10 19:39:45,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:45,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:45,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438160598] [2020-02-10 19:39:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:45,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:45,311 INFO L87 Difference]: Start difference. First operand 6197 states and 34055 transitions. Second operand 13 states. [2020-02-10 19:39:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:45,620 INFO L93 Difference]: Finished difference Result 11888 states and 58602 transitions. [2020-02-10 19:39:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:45,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:45,650 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 19:39:45,651 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 19:39:45,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 19:39:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 19:39:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:39:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34138 transitions. [2020-02-10 19:39:46,274 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34138 transitions. Word has length 34 [2020-02-10 19:39:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:46,275 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34138 transitions. [2020-02-10 19:39:46,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34138 transitions. [2020-02-10 19:39:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:46,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:46,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:46,286 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash 183995194, now seen corresponding path program 194 times [2020-02-10 19:39:46,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:46,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583231778] [2020-02-10 19:39:46,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:46,845 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:46,991 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 19:39:47,139 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:47,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583231778] [2020-02-10 19:39:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765276163] [2020-02-10 19:39:47,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:47,150 INFO L87 Difference]: Start difference. First operand 6221 states and 34138 transitions. Second operand 13 states. [2020-02-10 19:39:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:47,510 INFO L93 Difference]: Finished difference Result 11893 states and 58604 transitions. [2020-02-10 19:39:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:47,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:47,540 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 19:39:47,540 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 19:39:47,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 19:39:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6213. [2020-02-10 19:39:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:39:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34115 transitions. [2020-02-10 19:39:48,162 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34115 transitions. Word has length 34 [2020-02-10 19:39:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:48,163 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34115 transitions. [2020-02-10 19:39:48,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34115 transitions. [2020-02-10 19:39:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:48,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:48,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:48,174 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1650418240, now seen corresponding path program 195 times [2020-02-10 19:39:48,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:48,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561356692] [2020-02-10 19:39:48,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:48,885 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:49,032 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:39:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:49,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561356692] [2020-02-10 19:39:49,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:49,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:49,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123957576] [2020-02-10 19:39:49,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:49,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:49,044 INFO L87 Difference]: Start difference. First operand 6213 states and 34115 transitions. Second operand 13 states. [2020-02-10 19:39:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:49,429 INFO L93 Difference]: Finished difference Result 11883 states and 58585 transitions. [2020-02-10 19:39:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:49,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:49,462 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 19:39:49,463 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 19:39:49,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 19:39:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6220. [2020-02-10 19:39:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:39:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34128 transitions. [2020-02-10 19:39:50,081 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34128 transitions. Word has length 34 [2020-02-10 19:39:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:50,081 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34128 transitions. [2020-02-10 19:39:50,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34128 transitions. [2020-02-10 19:39:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:50,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:50,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:50,092 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:50,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash -350038310, now seen corresponding path program 196 times [2020-02-10 19:39:50,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:50,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228883334] [2020-02-10 19:39:50,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:50,636 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2020-02-10 19:39:50,760 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 19:39:50,904 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:51,052 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:51,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228883334] [2020-02-10 19:39:51,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:51,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:51,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459943079] [2020-02-10 19:39:51,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:51,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:51,064 INFO L87 Difference]: Start difference. First operand 6220 states and 34128 transitions. Second operand 13 states. [2020-02-10 19:39:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:51,480 INFO L93 Difference]: Finished difference Result 11884 states and 58580 transitions. [2020-02-10 19:39:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:51,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:51,511 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:39:51,511 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 19:39:51,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 19:39:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6213. [2020-02-10 19:39:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:39:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34108 transitions. [2020-02-10 19:39:52,136 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34108 transitions. Word has length 34 [2020-02-10 19:39:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:52,136 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34108 transitions. [2020-02-10 19:39:52,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34108 transitions. [2020-02-10 19:39:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:52,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:52,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:52,147 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1841067360, now seen corresponding path program 197 times [2020-02-10 19:39:52,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:52,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078135608] [2020-02-10 19:39:52,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:52,707 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:52,863 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 19:39:53,016 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:53,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078135608] [2020-02-10 19:39:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:53,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449957826] [2020-02-10 19:39:53,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:53,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:53,028 INFO L87 Difference]: Start difference. First operand 6213 states and 34108 transitions. Second operand 13 states. [2020-02-10 19:39:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:53,314 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 19:39:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:53,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:53,343 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 19:39:53,344 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 19:39:53,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 19:39:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6222. [2020-02-10 19:39:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:39:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34124 transitions. [2020-02-10 19:39:53,961 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34124 transitions. Word has length 34 [2020-02-10 19:39:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:53,961 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34124 transitions. [2020-02-10 19:39:53,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34124 transitions. [2020-02-10 19:39:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:53,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:53,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:53,972 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash 149318464, now seen corresponding path program 198 times [2020-02-10 19:39:53,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058916660] [2020-02-10 19:39:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:54,523 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:54,668 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:39:54,820 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:39: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 19:39:54,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058916660] [2020-02-10 19:39:54,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:54,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:54,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740438888] [2020-02-10 19:39:54,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:54,831 INFO L87 Difference]: Start difference. First operand 6222 states and 34124 transitions. Second operand 13 states. [2020-02-10 19:39:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:55,152 INFO L93 Difference]: Finished difference Result 11891 states and 58585 transitions. [2020-02-10 19:39:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:55,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:55,181 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 19:39:55,181 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 19:39:55,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 19:39:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6205. [2020-02-10 19:39:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 19:39:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34085 transitions. [2020-02-10 19:39:55,807 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34085 transitions. Word has length 34 [2020-02-10 19:39:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:55,808 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34085 transitions. [2020-02-10 19:39:55,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34085 transitions. [2020-02-10 19:39:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:55,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:55,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:55,819 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash -590359184, now seen corresponding path program 199 times [2020-02-10 19:39:55,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:55,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973484634] [2020-02-10 19:39:55,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:56,364 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:56,508 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:39:56,771 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:39: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 19:39:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973484634] [2020-02-10 19:39:56,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:56,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:56,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673630217] [2020-02-10 19:39:56,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:56,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:56,783 INFO L87 Difference]: Start difference. First operand 6205 states and 34085 transitions. Second operand 13 states. [2020-02-10 19:39:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:57,268 INFO L93 Difference]: Finished difference Result 11890 states and 58599 transitions. [2020-02-10 19:39:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:57,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:57,297 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 19:39:57,297 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 19:39:57,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 19:39:57,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6221. [2020-02-10 19:39:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:39:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34130 transitions. [2020-02-10 19:39:57,919 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34130 transitions. Word has length 34 [2020-02-10 19:39:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:57,919 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34130 transitions. [2020-02-10 19:39:57,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34130 transitions. [2020-02-10 19:39:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:57,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:57,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:57,930 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1575295468, now seen corresponding path program 200 times [2020-02-10 19:39:57,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:57,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084335720] [2020-02-10 19:39:57,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:58,485 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:39:58,628 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:39:58,775 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:39:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:58,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084335720] [2020-02-10 19:39:58,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:58,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:39:58,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923868252] [2020-02-10 19:39:58,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:39:58,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:39:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:58,786 INFO L87 Difference]: Start difference. First operand 6221 states and 34130 transitions. Second operand 13 states. [2020-02-10 19:39:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:59,261 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 19:39:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:39:59,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:39:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:59,291 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 19:39:59,291 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 19:39:59,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:39:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 19:39:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6213. [2020-02-10 19:39:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:39:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34107 transitions. [2020-02-10 19:39:59,919 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34107 transitions. Word has length 34 [2020-02-10 19:39:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:59,919 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34107 transitions. [2020-02-10 19:39:59,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:39:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34107 transitions. [2020-02-10 19:39:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:39:59,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:59,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:59,931 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1665344896, now seen corresponding path program 201 times [2020-02-10 19:39:59,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:59,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118960840] [2020-02-10 19:39:59,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:00,614 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:40:00,761 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:00,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118960840] [2020-02-10 19:40:00,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:00,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:00,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031263884] [2020-02-10 19:40:00,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:00,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:00,773 INFO L87 Difference]: Start difference. First operand 6213 states and 34107 transitions. Second operand 13 states. [2020-02-10 19:40:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:01,069 INFO L93 Difference]: Finished difference Result 11886 states and 58584 transitions. [2020-02-10 19:40:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:01,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:01,098 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 19:40:01,098 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 19:40:01,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 19:40:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 19:40:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:40:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34120 transitions. [2020-02-10 19:40:01,739 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34120 transitions. Word has length 34 [2020-02-10 19:40:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:01,739 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34120 transitions. [2020-02-10 19:40:01,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34120 transitions. [2020-02-10 19:40:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:01,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:01,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:01,750 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash -249184588, now seen corresponding path program 202 times [2020-02-10 19:40:01,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:01,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451673093] [2020-02-10 19:40:01,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:02,436 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:40:02,585 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:02,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451673093] [2020-02-10 19:40:02,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:02,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:02,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077042631] [2020-02-10 19:40:02,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:02,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:02,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:02,597 INFO L87 Difference]: Start difference. First operand 6220 states and 34120 transitions. Second operand 13 states. [2020-02-10 19:40:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:02,952 INFO L93 Difference]: Finished difference Result 11888 states and 58581 transitions. [2020-02-10 19:40:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:02,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:02,982 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 19:40:02,983 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:40:02,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:40:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 19:40:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 19:40:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 19:40:03,603 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 19:40:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:03,603 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 19:40:03,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 19:40:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:03,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:03,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:03,614 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -623998880, now seen corresponding path program 203 times [2020-02-10 19:40:03,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:03,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476711328] [2020-02-10 19:40:03,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:04,157 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:04,306 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:40:04,456 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:04,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476711328] [2020-02-10 19:40:04,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:04,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:04,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004689924] [2020-02-10 19:40:04,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:04,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:04,468 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:40:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:04,712 INFO L93 Difference]: Finished difference Result 11899 states and 58603 transitions. [2020-02-10 19:40:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:04,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:04,742 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 19:40:04,742 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 19:40:04,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 19:40:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6223. [2020-02-10 19:40:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:40:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34118 transitions. [2020-02-10 19:40:05,372 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34118 transitions. Word has length 34 [2020-02-10 19:40:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:05,372 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34118 transitions. [2020-02-10 19:40:05,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34118 transitions. [2020-02-10 19:40:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:05,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:05,383 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1877214864, now seen corresponding path program 204 times [2020-02-10 19:40:05,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:05,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749788684] [2020-02-10 19:40:05,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:06,082 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:40:06,232 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:06,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749788684] [2020-02-10 19:40:06,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:06,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:06,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663156858] [2020-02-10 19:40:06,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:06,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:06,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:06,244 INFO L87 Difference]: Start difference. First operand 6223 states and 34118 transitions. Second operand 13 states. [2020-02-10 19:40:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:06,603 INFO L93 Difference]: Finished difference Result 11896 states and 58588 transitions. [2020-02-10 19:40:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:06,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:06,634 INFO L225 Difference]: With dead ends: 11896 [2020-02-10 19:40:06,634 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 19:40:06,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 19:40:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6205. [2020-02-10 19:40:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 19:40:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34077 transitions. [2020-02-10 19:40:07,254 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34077 transitions. Word has length 34 [2020-02-10 19:40:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:07,254 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34077 transitions. [2020-02-10 19:40:07,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34077 transitions. [2020-02-10 19:40:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:07,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:07,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:07,266 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash -615236944, now seen corresponding path program 205 times [2020-02-10 19:40:07,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:07,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623872965] [2020-02-10 19:40:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:07,814 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 19:40:07,958 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:08,110 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:08,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623872965] [2020-02-10 19:40:08,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:08,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:08,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262575527] [2020-02-10 19:40:08,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:08,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:08,122 INFO L87 Difference]: Start difference. First operand 6205 states and 34077 transitions. Second operand 13 states. [2020-02-10 19:40:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:08,531 INFO L93 Difference]: Finished difference Result 11877 states and 58565 transitions. [2020-02-10 19:40:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:08,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:08,561 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 19:40:08,561 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 19:40:08,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 19:40:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6219. [2020-02-10 19:40:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:40:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34117 transitions. [2020-02-10 19:40:09,275 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34117 transitions. Word has length 34 [2020-02-10 19:40:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:09,275 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34117 transitions. [2020-02-10 19:40:09,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34117 transitions. [2020-02-10 19:40:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:09,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:09,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:09,287 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 685142986, now seen corresponding path program 206 times [2020-02-10 19:40:09,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:09,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669123986] [2020-02-10 19:40:09,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:09,840 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 19:40:09,978 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:10,132 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:10,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669123986] [2020-02-10 19:40:10,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:10,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:10,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011770380] [2020-02-10 19:40:10,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:10,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:10,145 INFO L87 Difference]: Start difference. First operand 6219 states and 34117 transitions. Second operand 13 states. [2020-02-10 19:40:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:10,445 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 19:40:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:10,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:10,475 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 19:40:10,475 INFO L226 Difference]: Without dead ends: 11851 [2020-02-10 19:40:10,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2020-02-10 19:40:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 6212. [2020-02-10 19:40:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:40:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 19:40:11,096 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 19:40:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:11,096 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 19:40:11,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 19:40:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:11,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:11,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:11,107 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1129127062, now seen corresponding path program 207 times [2020-02-10 19:40:11,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28996784] [2020-02-10 19:40:11,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:11,791 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:40:11,938 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:11,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28996784] [2020-02-10 19:40:11,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:11,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:11,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989346966] [2020-02-10 19:40:11,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:11,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:11,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:11,950 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 19:40:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:12,258 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 19:40:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:12,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:12,288 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 19:40:12,288 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 19:40:12,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 19:40:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6219. [2020-02-10 19:40:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:40:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34110 transitions. [2020-02-10 19:40:12,911 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34110 transitions. Word has length 34 [2020-02-10 19:40:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:12,911 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34110 transitions. [2020-02-10 19:40:12,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34110 transitions. [2020-02-10 19:40:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:12,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:12,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:12,923 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1749679926, now seen corresponding path program 208 times [2020-02-10 19:40:12,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:12,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085519334] [2020-02-10 19:40:12,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:13,612 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:40:13,761 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 19:40:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:13,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085519334] [2020-02-10 19:40:13,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:13,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:13,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733171193] [2020-02-10 19:40:13,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:13,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:13,773 INFO L87 Difference]: Start difference. First operand 6219 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:40:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:14,131 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 19:40:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:14,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:14,161 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 19:40:14,161 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:40:14,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:40:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 19:40:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:40:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34090 transitions. [2020-02-10 19:40:14,879 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34090 transitions. Word has length 34 [2020-02-10 19:40:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:14,879 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34090 transitions. [2020-02-10 19:40:14,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34090 transitions. [2020-02-10 19:40:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:14,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:14,891 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:14,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1636439574, now seen corresponding path program 209 times [2020-02-10 19:40:14,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:14,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409146464] [2020-02-10 19:40:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:15,443 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:15,590 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:15,743 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:15,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409146464] [2020-02-10 19:40:15,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:15,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:15,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797205410] [2020-02-10 19:40:15,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:15,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:15,755 INFO L87 Difference]: Start difference. First operand 6212 states and 34090 transitions. Second operand 13 states. [2020-02-10 19:40:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:16,143 INFO L93 Difference]: Finished difference Result 11881 states and 58560 transitions. [2020-02-10 19:40:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:16,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:16,172 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 19:40:16,173 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 19:40:16,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 19:40:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6220. [2020-02-10 19:40:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:40:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34105 transitions. [2020-02-10 19:40:16,796 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34105 transitions. Word has length 34 [2020-02-10 19:40:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:16,796 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34105 transitions. [2020-02-10 19:40:16,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34105 transitions. [2020-02-10 19:40:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:16,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:16,808 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:16,808 INFO L82 PathProgramCache]: Analyzing trace with hash -92607760, now seen corresponding path program 210 times [2020-02-10 19:40:16,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:16,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396290356] [2020-02-10 19:40:16,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:17,501 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:17,650 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:17,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396290356] [2020-02-10 19:40:17,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:17,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:17,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313993393] [2020-02-10 19:40:17,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:17,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:17,662 INFO L87 Difference]: Start difference. First operand 6220 states and 34105 transitions. Second operand 13 states. [2020-02-10 19:40:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:18,112 INFO L93 Difference]: Finished difference Result 11882 states and 58554 transitions. [2020-02-10 19:40:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:18,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:18,142 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 19:40:18,142 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 19:40:18,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 19:40:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6205. [2020-02-10 19:40:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 19:40:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34070 transitions. [2020-02-10 19:40:18,762 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34070 transitions. Word has length 34 [2020-02-10 19:40:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:18,762 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34070 transitions. [2020-02-10 19:40:18,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34070 transitions. [2020-02-10 19:40:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:18,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:18,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:18,774 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1266490516, now seen corresponding path program 211 times [2020-02-10 19:40:18,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:18,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449254887] [2020-02-10 19:40:18,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:19,344 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:40:19,493 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 19:40:19,641 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:19,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 19:40:19,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449254887] [2020-02-10 19:40:19,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:19,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:19,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538770816] [2020-02-10 19:40:19,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:19,653 INFO L87 Difference]: Start difference. First operand 6205 states and 34070 transitions. Second operand 13 states. [2020-02-10 19:40:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:19,996 INFO L93 Difference]: Finished difference Result 11901 states and 58610 transitions. [2020-02-10 19:40:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:19,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:20,026 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 19:40:20,026 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 19:40:20,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 19:40:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 19:40:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 19:40:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34120 transitions. [2020-02-10 19:40:20,760 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34120 transitions. Word has length 34 [2020-02-10 19:40:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:20,760 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34120 transitions. [2020-02-10 19:40:20,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34120 transitions. [2020-02-10 19:40:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:20,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:20,771 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -425258380, now seen corresponding path program 212 times [2020-02-10 19:40:20,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:20,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450054722] [2020-02-10 19:40:20,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:21,332 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:40:21,475 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:21,626 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:21,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450054722] [2020-02-10 19:40:21,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679440823] [2020-02-10 19:40:21,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:21,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:21,637 INFO L87 Difference]: Start difference. First operand 6223 states and 34120 transitions. Second operand 13 states. [2020-02-10 19:40:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:21,939 INFO L93 Difference]: Finished difference Result 11897 states and 58594 transitions. [2020-02-10 19:40:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:21,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:21,968 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 19:40:21,968 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 19:40:21,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 19:40:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 19:40:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:40:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 19:40:22,590 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 19:40:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:22,590 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 19:40:22,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 19:40:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:22,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:22,601 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -794369286, now seen corresponding path program 213 times [2020-02-10 19:40:22,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:22,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90004346] [2020-02-10 19:40:22,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:23,167 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:23,311 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 19:40:23,461 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:23,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90004346] [2020-02-10 19:40:23,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:23,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:23,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142895940] [2020-02-10 19:40:23,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:23,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:23,473 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 19:40:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:23,739 INFO L93 Difference]: Finished difference Result 11903 states and 58606 transitions. [2020-02-10 19:40:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:23,739 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:23,769 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 19:40:23,769 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 19:40:23,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 19:40:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6224. [2020-02-10 19:40:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 19:40:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34113 transitions. [2020-02-10 19:40:24,389 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34113 transitions. Word has length 34 [2020-02-10 19:40:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:24,389 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34113 transitions. [2020-02-10 19:40:24,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34113 transitions. [2020-02-10 19:40:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:24,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:24,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:24,400 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2047585270, now seen corresponding path program 214 times [2020-02-10 19:40:24,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:24,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650175427] [2020-02-10 19:40:24,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:24,962 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:25,108 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:25,253 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:25,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650175427] [2020-02-10 19:40:25,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:25,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:25,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221363119] [2020-02-10 19:40:25,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:25,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:25,263 INFO L87 Difference]: Start difference. First operand 6224 states and 34113 transitions. Second operand 13 states. [2020-02-10 19:40:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:25,619 INFO L93 Difference]: Finished difference Result 11900 states and 58591 transitions. [2020-02-10 19:40:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:25,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:25,647 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 19:40:25,647 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 19:40:25,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 19:40:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6214. [2020-02-10 19:40:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 19:40:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34086 transitions. [2020-02-10 19:40:26,268 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34086 transitions. Word has length 34 [2020-02-10 19:40:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:26,269 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34086 transitions. [2020-02-10 19:40:26,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34086 transitions. [2020-02-10 19:40:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:26,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:26,280 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -926406668, now seen corresponding path program 215 times [2020-02-10 19:40:26,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:26,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690254949] [2020-02-10 19:40:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:26,933 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:27,082 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:27,224 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:27,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690254949] [2020-02-10 19:40:27,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:27,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:27,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870793391] [2020-02-10 19:40:27,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:27,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:27,236 INFO L87 Difference]: Start difference. First operand 6214 states and 34086 transitions. Second operand 13 states. [2020-02-10 19:40:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:27,577 INFO L93 Difference]: Finished difference Result 11893 states and 58578 transitions. [2020-02-10 19:40:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:27,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:27,607 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 19:40:27,607 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 19:40:27,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 19:40:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6222. [2020-02-10 19:40:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:40:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34101 transitions. [2020-02-10 19:40:28,229 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34101 transitions. Word has length 34 [2020-02-10 19:40:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:28,229 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34101 transitions. [2020-02-10 19:40:28,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34101 transitions. [2020-02-10 19:40:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:28,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:28,240 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1650216922, now seen corresponding path program 216 times [2020-02-10 19:40:28,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:28,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197652169] [2020-02-10 19:40:28,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:28,795 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:28,942 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:29,092 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:29,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197652169] [2020-02-10 19:40:29,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:29,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:29,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891861816] [2020-02-10 19:40:29,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:29,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:29,103 INFO L87 Difference]: Start difference. First operand 6222 states and 34101 transitions. Second operand 13 states. [2020-02-10 19:40:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:29,443 INFO L93 Difference]: Finished difference Result 11894 states and 58572 transitions. [2020-02-10 19:40:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:29,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:29,474 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 19:40:29,474 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 19:40:29,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 19:40:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6197. [2020-02-10 19:40:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 19:40:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34047 transitions. [2020-02-10 19:40:30,090 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34047 transitions. Word has length 34 [2020-02-10 19:40:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:30,090 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34047 transitions. [2020-02-10 19:40:30,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34047 transitions. [2020-02-10 19:40:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:30,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:30,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:30,102 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1844398148, now seen corresponding path program 217 times [2020-02-10 19:40:30,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:30,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001668293] [2020-02-10 19:40:30,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:30,793 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:30,944 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:30,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001668293] [2020-02-10 19:40:30,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:30,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:30,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464370883] [2020-02-10 19:40:30,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:30,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:30,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:30,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:30,956 INFO L87 Difference]: Start difference. First operand 6197 states and 34047 transitions. Second operand 13 states. [2020-02-10 19:40:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:31,319 INFO L93 Difference]: Finished difference Result 11871 states and 58557 transitions. [2020-02-10 19:40:31,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:31,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:31,349 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 19:40:31,350 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:40:31,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:40:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6218. [2020-02-10 19:40:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34121 transitions. [2020-02-10 19:40:31,974 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34121 transitions. Word has length 34 [2020-02-10 19:40:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:31,974 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34121 transitions. [2020-02-10 19:40:31,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34121 transitions. [2020-02-10 19:40:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:31,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:31,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:31,985 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2052860902, now seen corresponding path program 218 times [2020-02-10 19:40:31,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:31,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402336369] [2020-02-10 19:40:31,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:32,682 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:32,936 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:32,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402336369] [2020-02-10 19:40:32,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:32,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:32,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277460731] [2020-02-10 19:40:32,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:32,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:32,947 INFO L87 Difference]: Start difference. First operand 6218 states and 34121 transitions. Second operand 13 states. [2020-02-10 19:40:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:33,280 INFO L93 Difference]: Finished difference Result 11874 states and 58556 transitions. [2020-02-10 19:40:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:33,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:33,310 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 19:40:33,310 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 19:40:33,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 19:40:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6211. [2020-02-10 19:40:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:40:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34101 transitions. [2020-02-10 19:40:33,932 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34101 transitions. Word has length 34 [2020-02-10 19:40:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:33,932 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34101 transitions. [2020-02-10 19:40:33,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34101 transitions. [2020-02-10 19:40:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:33,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:33,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:33,943 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:33,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2113144576, now seen corresponding path program 219 times [2020-02-10 19:40:33,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:33,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634651194] [2020-02-10 19:40:33,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:34,497 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:34,641 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:40:34,790 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:34,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634651194] [2020-02-10 19:40:34,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:34,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:34,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881482607] [2020-02-10 19:40:34,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:34,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:34,802 INFO L87 Difference]: Start difference. First operand 6211 states and 34101 transitions. Second operand 13 states. [2020-02-10 19:40:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:35,189 INFO L93 Difference]: Finished difference Result 11869 states and 58546 transitions. [2020-02-10 19:40:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:35,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:35,219 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 19:40:35,219 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 19:40:35,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 19:40:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 19:40:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 19:40:35,847 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 19:40:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:35,847 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 19:40:35,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 19:40:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:35,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:35,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:35,858 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash -812764646, now seen corresponding path program 220 times [2020-02-10 19:40:35,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433489640] [2020-02-10 19:40:35,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:36,409 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:36,552 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:36,704 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:36,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 19:40:36,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433489640] [2020-02-10 19:40:36,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:36,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:36,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777543575] [2020-02-10 19:40:36,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:36,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:36,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:36,717 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 19:40:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:37,176 INFO L93 Difference]: Finished difference Result 11870 states and 58541 transitions. [2020-02-10 19:40:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:37,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:37,208 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 19:40:37,208 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 19:40:37,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 19:40:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 19:40:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:40:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 19:40:37,831 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 19:40:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:37,831 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 19:40:37,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 19:40:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:37,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:37,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:37,842 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash -395788736, now seen corresponding path program 221 times [2020-02-10 19:40:37,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:37,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646938375] [2020-02-10 19:40:37,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:38,529 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:40:38,678 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646938375] [2020-02-10 19:40:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:38,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:38,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768899947] [2020-02-10 19:40:38,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:38,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:38,690 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 19:40:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:39,268 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 19:40:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:39,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:39,299 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 19:40:39,299 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 19:40:39,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 19:40:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6219. [2020-02-10 19:40:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:40:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34109 transitions. [2020-02-10 19:40:39,919 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34109 transitions. Word has length 34 [2020-02-10 19:40:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:39,919 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34109 transitions. [2020-02-10 19:40:39,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34109 transitions. [2020-02-10 19:40:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:39,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:39,931 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1314824572, now seen corresponding path program 222 times [2020-02-10 19:40:39,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:39,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65310227] [2020-02-10 19:40:39,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:40,620 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:40,767 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:40:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:40,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65310227] [2020-02-10 19:40:40,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:40,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:40,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162256841] [2020-02-10 19:40:40,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:40,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:40,779 INFO L87 Difference]: Start difference. First operand 6219 states and 34109 transitions. Second operand 13 states. [2020-02-10 19:40:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:41,120 INFO L93 Difference]: Finished difference Result 11874 states and 58542 transitions. [2020-02-10 19:40:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:41,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:41,151 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 19:40:41,151 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 19:40:41,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 19:40:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6204. [2020-02-10 19:40:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:40:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34074 transitions. [2020-02-10 19:40:41,772 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34074 transitions. Word has length 34 [2020-02-10 19:40:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:41,772 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34074 transitions. [2020-02-10 19:40:41,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34074 transitions. [2020-02-10 19:40:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:41,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:41,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:41,783 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 691278486, now seen corresponding path program 223 times [2020-02-10 19:40:41,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:41,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766792599] [2020-02-10 19:40:41,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:42,463 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:40:42,611 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:40:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:42,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766792599] [2020-02-10 19:40:42,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:42,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:42,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19304870] [2020-02-10 19:40:42,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:42,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:42,625 INFO L87 Difference]: Start difference. First operand 6204 states and 34074 transitions. Second operand 13 states. [2020-02-10 19:40:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:42,938 INFO L93 Difference]: Finished difference Result 11873 states and 58555 transitions. [2020-02-10 19:40:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:42,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:42,969 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 19:40:42,969 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 19:40:42,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 19:40:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6218. [2020-02-10 19:40:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 19:40:43,593 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 19:40:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:43,594 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 19:40:43,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 19:40:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:43,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:43,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:43,605 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:43,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:43,605 INFO L82 PathProgramCache]: Analyzing trace with hash 482815732, now seen corresponding path program 224 times [2020-02-10 19:40:43,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:43,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115950129] [2020-02-10 19:40:43,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:44,293 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:40:44,437 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:40:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:44,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115950129] [2020-02-10 19:40:44,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:44,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:44,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144650335] [2020-02-10 19:40:44,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:44,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:44,450 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 19:40:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:44,780 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 19:40:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:44,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:44,810 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 19:40:44,811 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 19:40:44,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 19:40:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6211. [2020-02-10 19:40:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:40:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 19:40:45,515 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 19:40:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:45,515 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 19:40:45,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 19:40:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:45,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:45,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:45,527 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2128071232, now seen corresponding path program 225 times [2020-02-10 19:40:45,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:45,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959974246] [2020-02-10 19:40:45,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:46,209 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:46,358 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:46,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959974246] [2020-02-10 19:40:46,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:46,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:46,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081818940] [2020-02-10 19:40:46,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:46,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:46,371 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 19:40:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:46,665 INFO L93 Difference]: Finished difference Result 11872 states and 58546 transitions. [2020-02-10 19:40:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:46,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:46,695 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 19:40:46,695 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 19:40:46,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 19:40:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6218. [2020-02-10 19:40:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 19:40:47,322 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 19:40:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:47,323 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 19:40:47,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 19:40:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:47,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:47,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:47,334 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -711910924, now seen corresponding path program 226 times [2020-02-10 19:40:47,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:47,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804873899] [2020-02-10 19:40:47,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:48,022 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:48,170 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:48,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804873899] [2020-02-10 19:40:48,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:48,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:48,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149506207] [2020-02-10 19:40:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:48,183 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 19:40:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:48,493 INFO L93 Difference]: Finished difference Result 11874 states and 58543 transitions. [2020-02-10 19:40:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:48,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:48,524 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 19:40:48,524 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 19:40:48,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 19:40:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6211. [2020-02-10 19:40:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:40:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 19:40:49,146 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 19:40:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:49,147 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 19:40:49,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 19:40:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:49,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:49,158 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1434112320, now seen corresponding path program 227 times [2020-02-10 19:40:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459447136] [2020-02-10 19:40:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:49,702 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:49,849 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:40:49,998 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:40:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:50,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459447136] [2020-02-10 19:40:50,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:50,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:50,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180634769] [2020-02-10 19:40:50,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:50,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:50,010 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 19:40:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:50,351 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 19:40:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:50,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:50,380 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 19:40:50,380 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 19:40:50,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 19:40:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6220. [2020-02-10 19:40:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:40:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34104 transitions. [2020-02-10 19:40:51,148 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34104 transitions. Word has length 34 [2020-02-10 19:40:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:51,148 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34104 transitions. [2020-02-10 19:40:51,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34104 transitions. [2020-02-10 19:40:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:51,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:51,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:51,160 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1415678294, now seen corresponding path program 228 times [2020-02-10 19:40:51,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:51,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748668124] [2020-02-10 19:40:51,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:51,717 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:51,859 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:52,012 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:52,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748668124] [2020-02-10 19:40:52,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:52,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:52,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038602132] [2020-02-10 19:40:52,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:52,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:52,024 INFO L87 Difference]: Start difference. First operand 6220 states and 34104 transitions. Second operand 13 states. [2020-02-10 19:40:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:52,390 INFO L93 Difference]: Finished difference Result 11879 states and 58546 transitions. [2020-02-10 19:40:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:52,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:52,419 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 19:40:52,419 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 19:40:52,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 19:40:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 19:40:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:40:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34067 transitions. [2020-02-10 19:40:53,038 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34067 transitions. Word has length 34 [2020-02-10 19:40:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:53,038 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34067 transitions. [2020-02-10 19:40:53,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34067 transitions. [2020-02-10 19:40:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:53,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:53,049 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:53,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 681327382, now seen corresponding path program 229 times [2020-02-10 19:40:53,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:53,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253345463] [2020-02-10 19:40:53,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:53,605 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:53,750 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:40:53,906 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:40:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:53,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253345463] [2020-02-10 19:40:53,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:53,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:53,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128862064] [2020-02-10 19:40:53,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:53,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:53,918 INFO L87 Difference]: Start difference. First operand 6204 states and 34067 transitions. Second operand 13 states. [2020-02-10 19:40:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:54,265 INFO L93 Difference]: Finished difference Result 11868 states and 58537 transitions. [2020-02-10 19:40:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:54,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:54,294 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 19:40:54,294 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 19:40:54,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 19:40:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6218. [2020-02-10 19:40:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 19:40:54,917 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 19:40:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:54,917 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 19:40:54,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 19:40:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:54,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:54,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:54,928 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1981707312, now seen corresponding path program 230 times [2020-02-10 19:40:54,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:54,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509111404] [2020-02-10 19:40:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:55,504 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:55,652 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:40:55,803 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 19:40:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:55,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509111404] [2020-02-10 19:40:55,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:55,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:55,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267380980] [2020-02-10 19:40:55,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:55,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:55,815 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 19:40:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:56,178 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 19:40:56,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:56,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:56,209 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 19:40:56,209 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 19:40:56,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 19:40:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6211. [2020-02-10 19:40:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:40:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 19:40:56,828 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 19:40:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:56,828 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 19:40:56,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 19:40:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:56,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:56,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:56,839 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1869275908, now seen corresponding path program 231 times [2020-02-10 19:40:56,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:56,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642733729] [2020-02-10 19:40:56,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:57,637 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:57,784 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:57,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642733729] [2020-02-10 19:40:57,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:57,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:57,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325646508] [2020-02-10 19:40:57,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:57,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:57,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:57,796 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 19:40:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:58,239 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 19:40:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:40:58,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:40:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:58,269 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 19:40:58,270 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 19:40:58,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:40:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 19:40:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 19:40:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:40:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34100 transitions. [2020-02-10 19:40:58,892 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34100 transitions. Word has length 34 [2020-02-10 19:40:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:58,892 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34100 transitions. [2020-02-10 19:40:58,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:40:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34100 transitions. [2020-02-10 19:40:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:40:58,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:58,903 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -453115600, now seen corresponding path program 232 times [2020-02-10 19:40:58,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:58,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458385688] [2020-02-10 19:40:58,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:59,608 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:40:59,754 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:40:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:59,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458385688] [2020-02-10 19:40:59,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:59,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:40:59,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976909493] [2020-02-10 19:40:59,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:40:59,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:40:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:59,766 INFO L87 Difference]: Start difference. First operand 6218 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:41:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:00,209 INFO L93 Difference]: Finished difference Result 11871 states and 58529 transitions. [2020-02-10 19:41:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:00,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:00,241 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 19:41:00,241 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 19:41:00,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 19:41:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 19:41:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 19:41:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34080 transitions. [2020-02-10 19:41:00,860 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34080 transitions. Word has length 34 [2020-02-10 19:41:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:00,860 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34080 transitions. [2020-02-10 19:41:00,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34080 transitions. [2020-02-10 19:41:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:00,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:00,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:00,871 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1361963396, now seen corresponding path program 233 times [2020-02-10 19:41:00,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:00,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134225475] [2020-02-10 19:41:00,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:01,430 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:01,575 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:01,727 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 19:41:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134225475] [2020-02-10 19:41:01,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:01,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:01,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315788788] [2020-02-10 19:41:01,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:01,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:01,739 INFO L87 Difference]: Start difference. First operand 6211 states and 34080 transitions. Second operand 13 states. [2020-02-10 19:41:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:02,103 INFO L93 Difference]: Finished difference Result 11872 states and 58532 transitions. [2020-02-10 19:41:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:02,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:02,133 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 19:41:02,133 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:41:02,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:41:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 19:41:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 19:41:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34095 transitions. [2020-02-10 19:41:02,756 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34095 transitions. Word has length 34 [2020-02-10 19:41:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:02,756 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34095 transitions. [2020-02-10 19:41:02,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34095 transitions. [2020-02-10 19:41:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:02,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:02,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:02,767 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:02,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1203956566, now seen corresponding path program 234 times [2020-02-10 19:41:02,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:02,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890998864] [2020-02-10 19:41:02,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:03,474 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:03,627 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:41:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:03,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890998864] [2020-02-10 19:41:03,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:03,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:03,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605932719] [2020-02-10 19:41:03,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:03,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:03,639 INFO L87 Difference]: Start difference. First operand 6219 states and 34095 transitions. Second operand 13 states. [2020-02-10 19:41:03,995 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-02-10 19:41:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:04,024 INFO L93 Difference]: Finished difference Result 11873 states and 58526 transitions. [2020-02-10 19:41:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:04,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:04,057 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 19:41:04,057 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 19:41:04,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 19:41:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6204. [2020-02-10 19:41:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 19:41:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34060 transitions. [2020-02-10 19:41:04,673 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34060 transitions. Word has length 34 [2020-02-10 19:41:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:04,673 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34060 transitions. [2020-02-10 19:41:04,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34060 transitions. [2020-02-10 19:41:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:04,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:04,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:04,685 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:04,685 INFO L82 PathProgramCache]: Analyzing trace with hash -970365580, now seen corresponding path program 235 times [2020-02-10 19:41:04,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:04,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137266859] [2020-02-10 19:41:04,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:05,380 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:05,530 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:41:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:05,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137266859] [2020-02-10 19:41:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:05,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629531307] [2020-02-10 19:41:05,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:05,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:05,541 INFO L87 Difference]: Start difference. First operand 6204 states and 34060 transitions. Second operand 13 states. [2020-02-10 19:41:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:05,859 INFO L93 Difference]: Finished difference Result 11882 states and 58564 transitions. [2020-02-10 19:41:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:05,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:05,890 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 19:41:05,890 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 19:41:05,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 19:41:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6220. [2020-02-10 19:41:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:41:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34106 transitions. [2020-02-10 19:41:06,519 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34106 transitions. Word has length 34 [2020-02-10 19:41:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:06,519 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34106 transitions. [2020-02-10 19:41:06,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34106 transitions. [2020-02-10 19:41:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:06,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:06,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:06,530 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 740247728, now seen corresponding path program 236 times [2020-02-10 19:41:06,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:06,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912639776] [2020-02-10 19:41:06,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:07,078 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 19:41:07,225 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:07,374 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 19:41:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:07,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912639776] [2020-02-10 19:41:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846338944] [2020-02-10 19:41:07,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:07,386 INFO L87 Difference]: Start difference. First operand 6220 states and 34106 transitions. Second operand 13 states. [2020-02-10 19:41:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:07,785 INFO L93 Difference]: Finished difference Result 11880 states and 58552 transitions. [2020-02-10 19:41:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:07,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:07,815 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 19:41:07,815 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 19:41:07,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 19:41:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 19:41:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:41:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34083 transitions. [2020-02-10 19:41:08,435 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34083 transitions. Word has length 34 [2020-02-10 19:41:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:08,435 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34083 transitions. [2020-02-10 19:41:08,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34083 transitions. [2020-02-10 19:41:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:08,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:08,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:08,446 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1263741914, now seen corresponding path program 237 times [2020-02-10 19:41:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965492563] [2020-02-10 19:41:08,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:09,009 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:09,152 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:09,305 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 19:41:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:09,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965492563] [2020-02-10 19:41:09,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:09,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:09,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670630965] [2020-02-10 19:41:09,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:09,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:09,318 INFO L87 Difference]: Start difference. First operand 6212 states and 34083 transitions. Second operand 13 states. [2020-02-10 19:41:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:09,677 INFO L93 Difference]: Finished difference Result 11884 states and 58561 transitions. [2020-02-10 19:41:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:09,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:09,707 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 19:41:09,707 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 19:41:09,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 19:41:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6221. [2020-02-10 19:41:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:41:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34100 transitions. [2020-02-10 19:41:10,429 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34100 transitions. Word has length 34 [2020-02-10 19:41:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:10,429 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34100 transitions. [2020-02-10 19:41:10,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34100 transitions. [2020-02-10 19:41:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:10,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:10,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:10,440 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1245307888, now seen corresponding path program 238 times [2020-02-10 19:41:10,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:10,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15904743] [2020-02-10 19:41:10,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:11,003 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:11,148 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:11,298 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:41:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:11,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15904743] [2020-02-10 19:41:11,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:11,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:11,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749066797] [2020-02-10 19:41:11,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:11,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:11,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:11,309 INFO L87 Difference]: Start difference. First operand 6221 states and 34100 transitions. Second operand 13 states. [2020-02-10 19:41:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:11,652 INFO L93 Difference]: Finished difference Result 11883 states and 58550 transitions. [2020-02-10 19:41:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:11,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:11,681 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 19:41:11,682 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 19:41:11,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 19:41:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6212. [2020-02-10 19:41:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 19:41:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34075 transitions. [2020-02-10 19:41:12,297 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34075 transitions. Word has length 34 [2020-02-10 19:41:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:12,297 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34075 transitions. [2020-02-10 19:41:12,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34075 transitions. [2020-02-10 19:41:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:12,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:12,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:12,308 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash 168792922, now seen corresponding path program 239 times [2020-02-10 19:41:12,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:12,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850944442] [2020-02-10 19:41:12,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:12,865 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:13,008 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:13,157 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 19:41:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:13,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850944442] [2020-02-10 19:41:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:13,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11158613] [2020-02-10 19:41:13,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:13,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:13,169 INFO L87 Difference]: Start difference. First operand 6212 states and 34075 transitions. Second operand 13 states. [2020-02-10 19:41:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:13,481 INFO L93 Difference]: Finished difference Result 11879 states and 58542 transitions. [2020-02-10 19:41:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:13,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:13,510 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 19:41:13,511 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 19:41:13,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 19:41:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6220. [2020-02-10 19:41:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 19:41:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34090 transitions. [2020-02-10 19:41:14,130 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34090 transitions. Word has length 34 [2020-02-10 19:41:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:14,130 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34090 transitions. [2020-02-10 19:41:14,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34090 transitions. [2020-02-10 19:41:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:14,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:14,141 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1560254412, now seen corresponding path program 240 times [2020-02-10 19:41:14,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:14,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28704741] [2020-02-10 19:41:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:14,701 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:14,845 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 19:41:14,995 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 19:41:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:15,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28704741] [2020-02-10 19:41:15,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:15,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:15,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044070767] [2020-02-10 19:41:15,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:15,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:15,006 INFO L87 Difference]: Start difference. First operand 6220 states and 34090 transitions. Second operand 13 states. [2020-02-10 19:41:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:15,355 INFO L93 Difference]: Finished difference Result 11880 states and 58536 transitions. [2020-02-10 19:41:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:15,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:15,385 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 19:41:15,385 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 19:41:15,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 19:41:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6185. [2020-02-10 19:41:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 19:41:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34018 transitions. [2020-02-10 19:41:16,003 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34018 transitions. Word has length 34 [2020-02-10 19:41:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:16,003 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34018 transitions. [2020-02-10 19:41:16,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34018 transitions. [2020-02-10 19:41:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:16,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:16,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:16,015 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1153765992, now seen corresponding path program 241 times [2020-02-10 19:41:16,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:16,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458064997] [2020-02-10 19:41:16,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:16,355 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 19:41:16,667 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:16,808 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:41:16,960 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:16,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458064997] [2020-02-10 19:41:16,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:16,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:16,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512077908] [2020-02-10 19:41:16,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:16,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:16,972 INFO L87 Difference]: Start difference. First operand 6185 states and 34018 transitions. Second operand 13 states. [2020-02-10 19:41:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:17,311 INFO L93 Difference]: Finished difference Result 11865 states and 58516 transitions. [2020-02-10 19:41:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:17,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:17,340 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 19:41:17,341 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 19:41:17,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 19:41:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6222. [2020-02-10 19:41:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 19:41:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34151 transitions. [2020-02-10 19:41:17,963 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34151 transitions. Word has length 34 [2020-02-10 19:41:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:17,963 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34151 transitions. [2020-02-10 19:41:17,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34151 transitions. [2020-02-10 19:41:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:17,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:17,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:17,974 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 517299138, now seen corresponding path program 242 times [2020-02-10 19:41:17,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:17,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332146265] [2020-02-10 19:41:17,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:18,518 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:18,659 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:18,811 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:41:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:18,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332146265] [2020-02-10 19:41:18,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:18,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:18,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680661332] [2020-02-10 19:41:18,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:18,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:18,824 INFO L87 Difference]: Start difference. First operand 6222 states and 34151 transitions. Second operand 13 states. [2020-02-10 19:41:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:19,321 INFO L93 Difference]: Finished difference Result 11863 states and 58502 transitions. [2020-02-10 19:41:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:19,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:19,351 INFO L225 Difference]: With dead ends: 11863 [2020-02-10 19:41:19,351 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 19:41:19,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 19:41:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 19:41:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:41:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34121 transitions. [2020-02-10 19:41:19,967 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34121 transitions. Word has length 34 [2020-02-10 19:41:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:19,967 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34121 transitions. [2020-02-10 19:41:19,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34121 transitions. [2020-02-10 19:41:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:19,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:19,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:19,978 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1377946600, now seen corresponding path program 243 times [2020-02-10 19:41:19,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:19,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448654573] [2020-02-10 19:41:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:20,517 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:41:20,660 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 19:41:20,806 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:20,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448654573] [2020-02-10 19:41:20,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:20,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:20,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261164408] [2020-02-10 19:41:20,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:20,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:20,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:20,818 INFO L87 Difference]: Start difference. First operand 6210 states and 34121 transitions. Second operand 13 states. [2020-02-10 19:41:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:21,223 INFO L93 Difference]: Finished difference Result 11853 states and 58482 transitions. [2020-02-10 19:41:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:21,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:21,252 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 19:41:21,252 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 19:41:21,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 19:41:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6218. [2020-02-10 19:41:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 19:41:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34136 transitions. [2020-02-10 19:41:21,875 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34136 transitions. Word has length 34 [2020-02-10 19:41:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:21,876 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34136 transitions. [2020-02-10 19:41:21,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34136 transitions. [2020-02-10 19:41:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:21,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:21,887 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1932084412, now seen corresponding path program 244 times [2020-02-10 19:41:21,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:21,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88850342] [2020-02-10 19:41:21,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:22,427 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:41:22,575 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:41:22,824 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88850342] [2020-02-10 19:41:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918958503] [2020-02-10 19:41:22,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:22,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:22,836 INFO L87 Difference]: Start difference. First operand 6218 states and 34136 transitions. Second operand 13 states. [2020-02-10 19:41:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:23,195 INFO L93 Difference]: Finished difference Result 11858 states and 58484 transitions. [2020-02-10 19:41:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:23,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:23,224 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 19:41:23,224 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 19:41:23,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 19:41:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6210. [2020-02-10 19:41:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 19:41:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34113 transitions. [2020-02-10 19:41:23,842 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34113 transitions. Word has length 34 [2020-02-10 19:41:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:23,842 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34113 transitions. [2020-02-10 19:41:23,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34113 transitions. [2020-02-10 19:41:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:23,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:23,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:23,854 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash 366417406, now seen corresponding path program 245 times [2020-02-10 19:41:23,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:23,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699609] [2020-02-10 19:41:23,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:24,518 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 19:41:24,666 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:41:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:24,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699609] [2020-02-10 19:41:24,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:24,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:24,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502448562] [2020-02-10 19:41:24,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:24,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:24,677 INFO L87 Difference]: Start difference. First operand 6210 states and 34113 transitions. Second operand 13 states. [2020-02-10 19:41:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:24,980 INFO L93 Difference]: Finished difference Result 11850 states and 58469 transitions. [2020-02-10 19:41:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:24,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:25,009 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 19:41:25,009 INFO L226 Difference]: Without dead ends: 11831 [2020-02-10 19:41:25,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11831 states. [2020-02-10 19:41:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11831 to 6217. [2020-02-10 19:41:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 19:41:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34126 transitions. [2020-02-10 19:41:25,629 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34126 transitions. Word has length 34 [2020-02-10 19:41:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:25,629 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34126 transitions. [2020-02-10 19:41:25,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34126 transitions. [2020-02-10 19:41:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:25,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:25,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:25,642 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 157954652, now seen corresponding path program 246 times [2020-02-10 19:41:25,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:25,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109164359] [2020-02-10 19:41:25,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:26,318 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:26,470 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:41:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:26,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109164359] [2020-02-10 19:41:26,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:26,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:26,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905986210] [2020-02-10 19:41:26,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:26,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:26,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:26,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:26,482 INFO L87 Difference]: Start difference. First operand 6217 states and 34126 transitions. Second operand 13 states. [2020-02-10 19:41:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:26,784 INFO L93 Difference]: Finished difference Result 11853 states and 58468 transitions. [2020-02-10 19:41:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:26,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:26,815 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 19:41:26,816 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 19:41:26,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 19:41:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6201. [2020-02-10 19:41:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 19:41:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34090 transitions. [2020-02-10 19:41:27,437 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34090 transitions. Word has length 34 [2020-02-10 19:41:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:27,437 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34090 transitions. [2020-02-10 19:41:27,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34090 transitions. [2020-02-10 19:41:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:27,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:27,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:27,448 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 747969188, now seen corresponding path program 247 times [2020-02-10 19:41:27,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:27,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878841413] [2020-02-10 19:41:27,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:27,998 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:28,147 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:41:28,291 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:28,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878841413] [2020-02-10 19:41:28,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:28,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:28,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618911587] [2020-02-10 19:41:28,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:28,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:28,304 INFO L87 Difference]: Start difference. First operand 6201 states and 34090 transitions. Second operand 13 states. [2020-02-10 19:41:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:28,591 INFO L93 Difference]: Finished difference Result 11861 states and 58496 transitions. [2020-02-10 19:41:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:28,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:28,620 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 19:41:28,620 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 19:41:28,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 19:41:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6221. [2020-02-10 19:41:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 19:41:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34139 transitions. [2020-02-10 19:41:29,324 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34139 transitions. Word has length 34 [2020-02-10 19:41:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:29,324 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34139 transitions. [2020-02-10 19:41:29,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34139 transitions. [2020-02-10 19:41:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:29,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:29,336 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 111502334, now seen corresponding path program 248 times [2020-02-10 19:41:29,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:29,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223267205] [2020-02-10 19:41:29,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:29,871 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:30,015 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:30,166 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:41:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:30,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223267205] [2020-02-10 19:41:30,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:30,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:30,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964575484] [2020-02-10 19:41:30,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:30,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:30,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:30,178 INFO L87 Difference]: Start difference. First operand 6221 states and 34139 transitions. Second operand 13 states. [2020-02-10 19:41:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:30,533 INFO L93 Difference]: Finished difference Result 11859 states and 58482 transitions. [2020-02-10 19:41:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:30,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:30,562 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 19:41:30,563 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 19:41:30,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 19:41:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6209. [2020-02-10 19:41:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:41:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34110 transitions. [2020-02-10 19:41:31,184 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34110 transitions. Word has length 34 [2020-02-10 19:41:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:31,184 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34110 transitions. [2020-02-10 19:41:31,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34110 transitions. [2020-02-10 19:41:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:31,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:31,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:31,195 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1548812252, now seen corresponding path program 249 times [2020-02-10 19:41:31,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:31,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643298668] [2020-02-10 19:41:31,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:31,734 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:41:31,879 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 19:41:32,028 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:32,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643298668] [2020-02-10 19:41:32,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:32,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:32,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840435355] [2020-02-10 19:41:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:32,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:32,040 INFO L87 Difference]: Start difference. First operand 6209 states and 34110 transitions. Second operand 13 states. [2020-02-10 19:41:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:32,309 INFO L93 Difference]: Finished difference Result 11852 states and 58467 transitions. [2020-02-10 19:41:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:32,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:32,339 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 19:41:32,339 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 19:41:32,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 19:41:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 19:41:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 19:41:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34122 transitions. [2020-02-10 19:41:32,956 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34122 transitions. Word has length 34 [2020-02-10 19:41:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:32,956 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34122 transitions. [2020-02-10 19:41:32,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34122 transitions. [2020-02-10 19:41:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:32,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:32,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:32,968 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1336656634, now seen corresponding path program 250 times [2020-02-10 19:41:32,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:32,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535232862] [2020-02-10 19:41:32,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:33,522 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:41:33,663 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 19:41:33,814 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 19:41:33,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 19:41:33,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535232862] [2020-02-10 19:41:33,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:33,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:33,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432507308] [2020-02-10 19:41:33,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:33,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:33,826 INFO L87 Difference]: Start difference. First operand 6216 states and 34122 transitions. Second operand 13 states. [2020-02-10 19:41:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:34,219 INFO L93 Difference]: Finished difference Result 11846 states and 58449 transitions. [2020-02-10 19:41:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:34,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:34,248 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 19:41:34,249 INFO L226 Difference]: Without dead ends: 11821 [2020-02-10 19:41:34,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-02-10 19:41:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 6209. [2020-02-10 19:41:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 19:41:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34103 transitions. [2020-02-10 19:41:34,870 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34103 transitions. Word has length 34 [2020-02-10 19:41:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:34,870 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34103 transitions. [2020-02-10 19:41:34,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34103 transitions. [2020-02-10 19:41:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:34,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:34,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:34,881 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1213946656, now seen corresponding path program 251 times [2020-02-10 19:41:34,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:34,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617232881] [2020-02-10 19:41:34,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:35,636 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 19:41:35,785 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 19:41:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:35,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617232881] [2020-02-10 19:41:35,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:35,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 19:41:35,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247366768] [2020-02-10 19:41:35,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 19:41:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 19:41:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:35,797 INFO L87 Difference]: Start difference. First operand 6209 states and 34103 transitions. Second operand 13 states. [2020-02-10 19:41:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:36,100 INFO L93 Difference]: Finished difference Result 11843 states and 58444 transitions. [2020-02-10 19:41:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 19:41:36,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 19:41:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:36,129 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 19:41:36,130 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 19:41:36,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 19:41:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 19:41:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6215. [2020-02-10 19:41:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 19:41:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34114 transitions. [2020-02-10 19:41:36,748 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34114 transitions. Word has length 34 [2020-02-10 19:41:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:36,748 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34114 transitions. [2020-02-10 19:41:36,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 19:41:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34114 transitions. [2020-02-10 19:41:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:41:36,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:36,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:36,760 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1638257892, now seen corresponding path program 252 times [2020-02-10 19:41:36,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:36,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326919767] [2020-02-10 19:41:36,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 19:41:37,087 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 19:41:37,090 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 19:41:37,091 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:41:37 BasicIcfg [2020-02-10 19:41:37,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:41:37,092 INFO L168 Benchmark]: Toolchain (without parser) took 735980.36 ms. Allocated memory was 140.0 MB in the beginning and 4.8 GB in the end (delta: 4.6 GB). Free memory was 120.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,092 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.10 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.29 ms. Allocated memory is still 140.0 MB. Free memory was 120.4 MB in the beginning and 118.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,092 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 140.0 MB. Free memory was 118.6 MB in the beginning and 117.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,092 INFO L168 Benchmark]: RCFGBuilder took 399.60 ms. Allocated memory is still 140.0 MB. Free memory was 117.4 MB in the beginning and 102.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,093 INFO L168 Benchmark]: TraceAbstraction took 735516.52 ms. Allocated memory was 140.0 MB in the beginning and 4.8 GB in the end (delta: 4.6 GB). Free memory was 102.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-02-10 19:41:37,093 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.10 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.29 ms. Allocated memory is still 140.0 MB. Free memory was 120.4 MB in the beginning and 118.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 140.0 MB. Free memory was 118.6 MB in the beginning and 117.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.60 ms. Allocated memory is still 140.0 MB. Free memory was 117.4 MB in the beginning and 102.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 735516.52 ms. Allocated memory was 140.0 MB in the beginning and 4.8 GB in the end (delta: 4.6 GB). Free memory was 102.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 21.9s, 92 ProgramPointsBefore, 80 ProgramPointsAfterwards, 168 TransitionsBefore, 156 TransitionsAfterwards, 5060 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1375 CheckedPairsTotal, 12 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 735.1s, OverallIterations: 262, TraceHistogramMax: 1, AutomataDifference: 117.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 123.2s, HoareTripleCheckerStatistics: 47963 SDtfs, 73021 SDslu, 137827 SDs, 0 SdLazy, 36407 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3022 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 232.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179196occurred 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: 250.1s AutomataMinimizationTime, 261 MinimizatonAttempts, 1414296 StatesRemovedByMinimization, 251 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 217.4s InterpolantComputationTime, 8874 NumberOfCodeBlocks, 8874 NumberOfCodeBlocksAsserted, 261 NumberOfCheckSat, 8613 ConstructedInterpolants, 0 QuantifiedInterpolants, 12259137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 261 InterpolantComputations, 261 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