/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 18:30:48,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:30:48,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:30:48,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:30:48,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:30:48,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:30:48,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:30:48,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:30:48,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:30:48,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:30:48,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:30:48,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:30:48,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:30:48,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:30:48,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:30:48,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:30:48,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:30:48,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:30:48,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:30:48,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:30:48,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:30:48,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:30:48,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:30:48,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:30:48,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:30:48,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:30:48,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:30:48,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:30:48,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:30:48,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:30:48,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:30:48,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:30:48,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:30:48,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:30:48,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:30:48,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:30:48,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:30:48,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:30:48,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:30:48,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:30:48,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:30:48,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-01-16 18:30:48,174 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:30:48,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:30:48,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:30:48,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:30:48,176 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:30:48,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:30:48,177 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:30:48,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:30:48,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:30:48,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:30:48,178 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:30:48,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:30:48,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:30:48,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:30:48,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:30:48,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:30:48,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:30:48,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:30:48,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:30:48,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:30:48,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:30:48,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:30:48,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:30:48,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:30:48,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:30:48,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:30:48,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:30:48,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:30:48,464 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:30:48,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl [2020-01-16 18:30:48,466 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl' [2020-01-16 18:30:48,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:30:48,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:30:48,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:30:48,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:30:48,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:30:48,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:30:48,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:30:48,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:30:48,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:30:48,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/1) ... [2020-01-16 18:30:48,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:30:48,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:30:48,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:30:48,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:30:48,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (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-01-16 18:30:48,650 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:30:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:30:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:30:48,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:30:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:30:48,654 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:30:48,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:30:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:30:48,655 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:30:48,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 18:30:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 18:30:48,655 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 18:30:48,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:30:48,656 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:30:48,656 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:30:48,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:30:48,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:30:48,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:30:48,657 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 18:30:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 18:30:48,657 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 18:30:48,657 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-01-16 18:30:48,657 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-01-16 18:30:48,658 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-01-16 18:30:48,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-01-16 18:30:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-01-16 18:30:48,659 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-01-16 18:30:48,661 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 18:30:48,917 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:30:48,918 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:30:48,919 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:30:48 BoogieIcfgContainer [2020-01-16 18:30:48,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:30:48,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:30:48,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:30:48,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:30:48,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:48" (1/2) ... [2020-01-16 18:30:48,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d2648 and model type example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:30:48, skipping insertion in model container [2020-01-16 18:30:48,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:30:48" (2/2) ... [2020-01-16 18:30:48,930 INFO L109 eAbstractionObserver]: Analyzing ICFG example_8.bpl [2020-01-16 18:30:48,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:30:48,944 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:30:48,951 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:30:48,952 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:30:49,193 INFO L250 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-01-16 18:30:49,213 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:30:49,214 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:30:49,214 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:30:49,214 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:30:49,214 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:30:49,214 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:30:49,215 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:30:49,215 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:30:49,232 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions [2020-01-16 18:30:49,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-01-16 18:30:49,638 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-01-16 18:30:49,638 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-01-16 18:30:49,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-01-16 18:30:49,697 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-01-16 18:30:49,948 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-01-16 18:30:49,949 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-01-16 18:30:49,959 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-01-16 18:30:49,989 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1904 [2020-01-16 18:30:49,991 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-01-16 18:30:50,180 INFO L206 etLargeBlockEncoding]: Checked pairs total: 532 [2020-01-16 18:30:50,180 INFO L214 etLargeBlockEncoding]: Total number of compositions: 9 [2020-01-16 18:30:50,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 90 transitions [2020-01-16 18:30:50,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6818 states. [2020-01-16 18:30:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states. [2020-01-16 18:30:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:51,064 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:51,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:51,066 INFO L426 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1176015965, now seen corresponding path program 1 times [2020-01-16 18:30:51,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:51,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193068061] [2020-01-16 18:30:51,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:51,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193068061] [2020-01-16 18:30:51,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:51,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:51,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105757643] [2020-01-16 18:30:51,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:51,258 INFO L87 Difference]: Start difference. First operand 6818 states. Second operand 3 states. [2020-01-16 18:30:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:51,470 INFO L93 Difference]: Finished difference Result 6690 states and 34994 transitions. [2020-01-16 18:30:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:51,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:51,561 INFO L225 Difference]: With dead ends: 6690 [2020-01-16 18:30:51,561 INFO L226 Difference]: Without dead ends: 6689 [2020-01-16 18:30:51,563 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-01-16 18:30:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2020-01-16 18:30:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2020-01-16 18:30:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2020-01-16 18:30:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 34993 transitions. [2020-01-16 18:30:52,453 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 34993 transitions. Word has length 25 [2020-01-16 18:30:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:52,455 INFO L478 AbstractCegarLoop]: Abstraction has 6689 states and 34993 transitions. [2020-01-16 18:30:52,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 34993 transitions. [2020-01-16 18:30:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:52,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:52,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:52,484 INFO L426 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1467806563, now seen corresponding path program 1 times [2020-01-16 18:30:52,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:52,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006197538] [2020-01-16 18:30:52,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:52,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006197538] [2020-01-16 18:30:52,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:52,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:52,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5096472] [2020-01-16 18:30:52,566 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:52,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:52,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:52,569 INFO L87 Difference]: Start difference. First operand 6689 states and 34993 transitions. Second operand 3 states. [2020-01-16 18:30:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:52,670 INFO L93 Difference]: Finished difference Result 4881 states and 24065 transitions. [2020-01-16 18:30:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:52,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:52,737 INFO L225 Difference]: With dead ends: 4881 [2020-01-16 18:30:52,737 INFO L226 Difference]: Without dead ends: 4881 [2020-01-16 18:30:52,738 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-01-16 18:30:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2020-01-16 18:30:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2020-01-16 18:30:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2020-01-16 18:30:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 24065 transitions. [2020-01-16 18:30:52,965 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 24065 transitions. Word has length 25 [2020-01-16 18:30:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:52,966 INFO L478 AbstractCegarLoop]: Abstraction has 4881 states and 24065 transitions. [2020-01-16 18:30:52,966 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 24065 transitions. [2020-01-16 18:30:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:52,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:52,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:52,985 INFO L426 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash -795426887, now seen corresponding path program 1 times [2020-01-16 18:30:52,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:52,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246689787] [2020-01-16 18:30:52,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246689787] [2020-01-16 18:30:53,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:53,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845731216] [2020-01-16 18:30:53,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:53,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:53,015 INFO L87 Difference]: Start difference. First operand 4881 states and 24065 transitions. Second operand 3 states. [2020-01-16 18:30:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,074 INFO L93 Difference]: Finished difference Result 3205 states and 15221 transitions. [2020-01-16 18:30:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:53,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,094 INFO L225 Difference]: With dead ends: 3205 [2020-01-16 18:30:53,095 INFO L226 Difference]: Without dead ends: 3205 [2020-01-16 18:30:53,095 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-01-16 18:30:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2020-01-16 18:30:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2020-01-16 18:30:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-01-16 18:30:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 15221 transitions. [2020-01-16 18:30:53,332 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 15221 transitions. Word has length 25 [2020-01-16 18:30:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,332 INFO L478 AbstractCegarLoop]: Abstraction has 3205 states and 15221 transitions. [2020-01-16 18:30:53,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 15221 transitions. [2020-01-16 18:30:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:53,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,344 INFO L426 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash 694354523, now seen corresponding path program 1 times [2020-01-16 18:30:53,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852687561] [2020-01-16 18:30:53,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852687561] [2020-01-16 18:30:53,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:53,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122119034] [2020-01-16 18:30:53,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:53,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:53,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:53,379 INFO L87 Difference]: Start difference. First operand 3205 states and 15221 transitions. Second operand 3 states. [2020-01-16 18:30:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,416 INFO L93 Difference]: Finished difference Result 2757 states and 12469 transitions. [2020-01-16 18:30:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:53,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,433 INFO L225 Difference]: With dead ends: 2757 [2020-01-16 18:30:53,434 INFO L226 Difference]: Without dead ends: 2757 [2020-01-16 18:30:53,434 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-01-16 18:30:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2020-01-16 18:30:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2020-01-16 18:30:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2020-01-16 18:30:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 12469 transitions. [2020-01-16 18:30:53,545 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 12469 transitions. Word has length 25 [2020-01-16 18:30:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,545 INFO L478 AbstractCegarLoop]: Abstraction has 2757 states and 12469 transitions. [2020-01-16 18:30:53,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 12469 transitions. [2020-01-16 18:30:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:53,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,555 INFO L426 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1749585931, now seen corresponding path program 1 times [2020-01-16 18:30:53,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65475852] [2020-01-16 18:30:53,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65475852] [2020-01-16 18:30:53,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:53,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651734987] [2020-01-16 18:30:53,584 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:53,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:53,585 INFO L87 Difference]: Start difference. First operand 2757 states and 12469 transitions. Second operand 3 states. [2020-01-16 18:30:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,611 INFO L93 Difference]: Finished difference Result 1773 states and 7633 transitions. [2020-01-16 18:30:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:53,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,620 INFO L225 Difference]: With dead ends: 1773 [2020-01-16 18:30:53,620 INFO L226 Difference]: Without dead ends: 1773 [2020-01-16 18:30:53,621 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-01-16 18:30:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-01-16 18:30:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2020-01-16 18:30:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-01-16 18:30:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 7633 transitions. [2020-01-16 18:30:53,691 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 7633 transitions. Word has length 25 [2020-01-16 18:30:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,692 INFO L478 AbstractCegarLoop]: Abstraction has 1773 states and 7633 transitions. [2020-01-16 18:30:53,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 7633 transitions. [2020-01-16 18:30:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:53,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,698 INFO L426 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1906045009, now seen corresponding path program 1 times [2020-01-16 18:30:53,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508376697] [2020-01-16 18:30:53,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,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-01-16 18:30:53,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508376697] [2020-01-16 18:30:53,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:53,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825714678] [2020-01-16 18:30:53,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:53,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:53,724 INFO L87 Difference]: Start difference. First operand 1773 states and 7633 transitions. Second operand 3 states. [2020-01-16 18:30:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,746 INFO L93 Difference]: Finished difference Result 1119 states and 4673 transitions. [2020-01-16 18:30:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:53,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,752 INFO L225 Difference]: With dead ends: 1119 [2020-01-16 18:30:53,752 INFO L226 Difference]: Without dead ends: 1119 [2020-01-16 18:30:53,752 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-01-16 18:30:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-01-16 18:30:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-01-16 18:30:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-01-16 18:30:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 4673 transitions. [2020-01-16 18:30:53,797 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 4673 transitions. Word has length 25 [2020-01-16 18:30:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,798 INFO L478 AbstractCegarLoop]: Abstraction has 1119 states and 4673 transitions. [2020-01-16 18:30:53,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 4673 transitions. [2020-01-16 18:30:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:53,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,802 INFO L426 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash -389208845, now seen corresponding path program 1 times [2020-01-16 18:30:53,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210088905] [2020-01-16 18:30:53,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210088905] [2020-01-16 18:30:53,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:53,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726017216] [2020-01-16 18:30:53,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:53,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:53,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:53,828 INFO L87 Difference]: Start difference. First operand 1119 states and 4673 transitions. Second operand 3 states. [2020-01-16 18:30:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,842 INFO L93 Difference]: Finished difference Result 767 states and 3073 transitions. [2020-01-16 18:30:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:53,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:30:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,846 INFO L225 Difference]: With dead ends: 767 [2020-01-16 18:30:53,846 INFO L226 Difference]: Without dead ends: 767 [2020-01-16 18:30:53,847 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-01-16 18:30:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-01-16 18:30:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2020-01-16 18:30:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-01-16 18:30:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3073 transitions. [2020-01-16 18:30:53,943 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3073 transitions. Word has length 25 [2020-01-16 18:30:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,945 INFO L478 AbstractCegarLoop]: Abstraction has 767 states and 3073 transitions. [2020-01-16 18:30:53,945 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3073 transitions. [2020-01-16 18:30:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:53,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,948 INFO L426 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash -377910571, now seen corresponding path program 1 times [2020-01-16 18:30:53,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661167647] [2020-01-16 18:30:53,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:54,594 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:30:54,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-01-16 18:30:54,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661167647] [2020-01-16 18:30:54,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:54,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:54,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669814147] [2020-01-16 18:30:54,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:54,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:54,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:54,742 INFO L87 Difference]: Start difference. First operand 767 states and 3073 transitions. Second operand 10 states. [2020-01-16 18:30:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:54,937 INFO L93 Difference]: Finished difference Result 1367 states and 4850 transitions. [2020-01-16 18:30:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:54,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:54,943 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:30:54,943 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:30:54,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:30:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-01-16 18:30:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:30:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-01-16 18:30:54,986 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-01-16 18:30:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:54,987 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-01-16 18:30:54,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-01-16 18:30:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:54,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:54,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:54,990 INFO L426 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 592341043, now seen corresponding path program 2 times [2020-01-16 18:30:54,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:54,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909580160] [2020-01-16 18:30:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:55,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909580160] [2020-01-16 18:30:55,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:55,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:55,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535915362] [2020-01-16 18:30:55,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:55,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:55,503 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:30:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:55,680 INFO L93 Difference]: Finished difference Result 1369 states and 4850 transitions. [2020-01-16 18:30:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:55,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:55,686 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:30:55,687 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:30:55,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:30:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:30:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:30:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3153 transitions. [2020-01-16 18:30:55,733 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3153 transitions. Word has length 25 [2020-01-16 18:30:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:55,733 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3153 transitions. [2020-01-16 18:30:55,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3153 transitions. [2020-01-16 18:30:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:55,736 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:55,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:55,737 INFO L426 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1548123507, now seen corresponding path program 3 times [2020-01-16 18:30:55,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:55,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670017356] [2020-01-16 18:30:55,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:56,032 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-01-16 18:30: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-01-16 18:30:56,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670017356] [2020-01-16 18:30:56,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:56,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:56,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526173774] [2020-01-16 18:30:56,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:56,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:56,426 INFO L87 Difference]: Start difference. First operand 785 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:30:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:56,613 INFO L93 Difference]: Finished difference Result 1363 states and 4838 transitions. [2020-01-16 18:30:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:56,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:56,620 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:30:56,620 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:30:56,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:30:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-01-16 18:30:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:30:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3158 transitions. [2020-01-16 18:30:56,660 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3158 transitions. Word has length 25 [2020-01-16 18:30:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:56,661 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3158 transitions. [2020-01-16 18:30:56,661 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3158 transitions. [2020-01-16 18:30:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:56,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:56,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:56,664 INFO L426 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1766089071, now seen corresponding path program 4 times [2020-01-16 18:30:56,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:56,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700256193] [2020-01-16 18:30:56,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:57,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700256193] [2020-01-16 18:30:57,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:57,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:57,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566031701] [2020-01-16 18:30:57,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:57,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:57,130 INFO L87 Difference]: Start difference. First operand 788 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:30:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:57,307 INFO L93 Difference]: Finished difference Result 1362 states and 4833 transitions. [2020-01-16 18:30:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:57,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:57,315 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:30:57,315 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:30:57,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:30:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-01-16 18:30:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:30:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-01-16 18:30:57,356 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-01-16 18:30:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:57,356 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-01-16 18:30:57,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-01-16 18:30:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:57,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:57,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:57,359 INFO L426 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 930966229, now seen corresponding path program 5 times [2020-01-16 18:30:57,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:57,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683004562] [2020-01-16 18:30:57,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:57,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683004562] [2020-01-16 18:30:57,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:57,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:57,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668735570] [2020-01-16 18:30:57,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:57,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:57,772 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:30:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:57,936 INFO L93 Difference]: Finished difference Result 1367 states and 4843 transitions. [2020-01-16 18:30:57,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:57,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:57,939 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:30:57,939 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:30:57,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:30:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:30:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:30:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:30:57,975 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:30:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:57,976 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:30:57,976 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:30:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:57,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:57,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:57,978 INFO L426 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1753060109, now seen corresponding path program 6 times [2020-01-16 18:30:57,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:57,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977347916] [2020-01-16 18:30:57,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:58,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977347916] [2020-01-16 18:30:58,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:58,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:58,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974433329] [2020-01-16 18:30:58,458 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:58,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:58,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:58,459 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:30:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:58,631 INFO L93 Difference]: Finished difference Result 1364 states and 4834 transitions. [2020-01-16 18:30:58,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:58,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:58,636 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:30:58,636 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:30:58,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:30:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-01-16 18:30:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:30:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3142 transitions. [2020-01-16 18:30:58,672 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3142 transitions. Word has length 25 [2020-01-16 18:30:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:58,672 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3142 transitions. [2020-01-16 18:30:58,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3142 transitions. [2020-01-16 18:30:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:58,674 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:58,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:58,675 INFO L426 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -800396297, now seen corresponding path program 7 times [2020-01-16 18:30:58,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:58,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616808668] [2020-01-16 18:30:58,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:59,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616808668] [2020-01-16 18:30:59,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:59,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387993641] [2020-01-16 18:30:59,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:59,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:59,090 INFO L87 Difference]: Start difference. First operand 782 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:30:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,273 INFO L93 Difference]: Finished difference Result 1376 states and 4871 transitions. [2020-01-16 18:30:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:30:59,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:30:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,278 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:30:59,278 INFO L226 Difference]: Without dead ends: 1363 [2020-01-16 18:30:59,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:30:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-01-16 18:30:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 790. [2020-01-16 18:30:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:30:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3164 transitions. [2020-01-16 18:30:59,311 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3164 transitions. Word has length 25 [2020-01-16 18:30:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,311 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3164 transitions. [2020-01-16 18:30:59,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:30:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3164 transitions. [2020-01-16 18:30:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:30:59,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:59,314 INFO L426 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:30:59,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash 169855317, now seen corresponding path program 8 times [2020-01-16 18:30:59,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60911251] [2020-01-16 18:30:59,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:59,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60911251] [2020-01-16 18:30:59,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:30:59,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110756993] [2020-01-16 18:30:59,889 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:30:59,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:30:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:30:59,890 INFO L87 Difference]: Start difference. First operand 790 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:31:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:00,064 INFO L93 Difference]: Finished difference Result 1378 states and 4871 transitions. [2020-01-16 18:31:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:00,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:00,068 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:31:00,068 INFO L226 Difference]: Without dead ends: 1359 [2020-01-16 18:31:00,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-01-16 18:31:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 786. [2020-01-16 18:31:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3153 transitions. [2020-01-16 18:31:00,123 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3153 transitions. Word has length 25 [2020-01-16 18:31:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:00,124 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3153 transitions. [2020-01-16 18:31:00,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3153 transitions. [2020-01-16 18:31:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:00,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:00,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:00,127 INFO L426 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1243295437, now seen corresponding path program 9 times [2020-01-16 18:31:00,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:00,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184497960] [2020-01-16 18:31:00,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:00,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184497960] [2020-01-16 18:31:00,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:00,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:00,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365379190] [2020-01-16 18:31:00,611 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:00,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:00,612 INFO L87 Difference]: Start difference. First operand 786 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:31:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:00,770 INFO L93 Difference]: Finished difference Result 1377 states and 4869 transitions. [2020-01-16 18:31:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:00,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:00,774 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:31:00,774 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:31:00,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:31:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-01-16 18:31:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3160 transitions. [2020-01-16 18:31:00,808 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3160 transitions. Word has length 25 [2020-01-16 18:31:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:00,808 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3160 transitions. [2020-01-16 18:31:00,808 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3160 transitions. [2020-01-16 18:31:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:00,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:00,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:00,811 INFO L426 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -252037615, now seen corresponding path program 10 times [2020-01-16 18:31:00,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:00,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915537499] [2020-01-16 18:31:00,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,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-01-16 18:31:01,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915537499] [2020-01-16 18:31:01,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:01,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033163958] [2020-01-16 18:31:01,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:01,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:01,233 INFO L87 Difference]: Start difference. First operand 790 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:31:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:01,394 INFO L93 Difference]: Finished difference Result 1380 states and 4871 transitions. [2020-01-16 18:31:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:01,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:01,398 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:31:01,398 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:31:01,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:31:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-01-16 18:31:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-01-16 18:31:01,450 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-01-16 18:31:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:01,451 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-01-16 18:31:01,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-01-16 18:31:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:01,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:01,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:01,453 INFO L426 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:01,454 INFO L82 PathProgramCache]: Analyzing trace with hash 834076727, now seen corresponding path program 11 times [2020-01-16 18:31:01,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:01,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368171029] [2020-01-16 18:31:01,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368171029] [2020-01-16 18:31:01,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:01,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641683038] [2020-01-16 18:31:01,868 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:01,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:01,869 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:31:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:02,018 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-01-16 18:31:02,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:02,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:02,022 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:31:02,022 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:31:02,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:31:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 792. [2020-01-16 18:31:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:31:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3160 transitions. [2020-01-16 18:31:02,058 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3160 transitions. Word has length 25 [2020-01-16 18:31:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:02,059 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3160 transitions. [2020-01-16 18:31:02,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3160 transitions. [2020-01-16 18:31:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:02,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:02,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:02,061 INFO L426 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash -239008653, now seen corresponding path program 12 times [2020-01-16 18:31:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:02,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005329616] [2020-01-16 18:31:02,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:02,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-01-16 18:31:02,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005329616] [2020-01-16 18:31:02,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:02,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:02,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136252457] [2020-01-16 18:31:02,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:02,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:02,474 INFO L87 Difference]: Start difference. First operand 792 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:31:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:02,614 INFO L93 Difference]: Finished difference Result 1384 states and 4875 transitions. [2020-01-16 18:31:02,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:02,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:02,618 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:31:02,618 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:02,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 782. [2020-01-16 18:31:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-01-16 18:31:02,645 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-01-16 18:31:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:02,645 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-01-16 18:31:02,645 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-01-16 18:31:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:02,647 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:02,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:02,648 INFO L426 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash 703152055, now seen corresponding path program 13 times [2020-01-16 18:31:02,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:02,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650091305] [2020-01-16 18:31:02,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:03,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650091305] [2020-01-16 18:31:03,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:03,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:03,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874485853] [2020-01-16 18:31:03,072 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:03,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:03,073 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:31:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:03,210 INFO L93 Difference]: Finished difference Result 1364 states and 4837 transitions. [2020-01-16 18:31:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:03,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:03,213 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:03,213 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:31:03,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:31:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-01-16 18:31:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:31:03,241 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:03,241 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:31:03,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:31:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:03,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:03,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:03,244 INFO L426 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1683906773, now seen corresponding path program 14 times [2020-01-16 18:31:03,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:03,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571566299] [2020-01-16 18:31:03,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:03,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-01-16 18:31:03,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571566299] [2020-01-16 18:31:03,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:03,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:03,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414919579] [2020-01-16 18:31:03,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:03,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:03,718 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:03,885 INFO L93 Difference]: Finished difference Result 1363 states and 4832 transitions. [2020-01-16 18:31:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:03,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:03,893 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:31:03,893 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:31:03,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:31:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-01-16 18:31:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-01-16 18:31:03,920 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-01-16 18:31:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:03,921 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-01-16 18:31:03,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-01-16 18:31:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:03,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:03,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:03,924 INFO L426 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:03,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1665781163, now seen corresponding path program 15 times [2020-01-16 18:31:03,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:03,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170922586] [2020-01-16 18:31:03,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:04,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170922586] [2020-01-16 18:31:04,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:04,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:04,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170950419] [2020-01-16 18:31:04,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:04,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:04,330 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:31:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:04,495 INFO L93 Difference]: Finished difference Result 1369 states and 4845 transitions. [2020-01-16 18:31:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:04,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:04,498 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:31:04,498 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:31:04,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:31:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 789. [2020-01-16 18:31:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:31:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:31:04,523 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:31:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:04,524 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:31:04,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:31:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:04,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:04,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:04,526 INFO L426 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -674523341, now seen corresponding path program 16 times [2020-01-16 18:31:04,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:04,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392488374] [2020-01-16 18:31:04,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:04,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392488374] [2020-01-16 18:31:04,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:04,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:04,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986150324] [2020-01-16 18:31:04,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:04,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:04,938 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:31:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:05,111 INFO L93 Difference]: Finished difference Result 1372 states and 4847 transitions. [2020-01-16 18:31:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:05,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:05,115 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:31:05,115 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:31:05,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:31:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 785. [2020-01-16 18:31:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:31:05,138 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:31:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:05,138 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:31:05,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:31:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:05,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:05,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:05,141 INFO L426 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1946839113, now seen corresponding path program 17 times [2020-01-16 18:31:05,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:05,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990452172] [2020-01-16 18:31:05,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:05,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990452172] [2020-01-16 18:31:05,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:05,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:05,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759131265] [2020-01-16 18:31:05,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:05,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:05,558 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:31:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:05,705 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-01-16 18:31:05,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:05,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:05,709 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:31:05,709 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:31:05,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:31:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-01-16 18:31:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:31:05,743 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:31:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:05,743 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:31:05,743 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:31:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:05,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:05,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:05,746 INFO L426 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash -335898155, now seen corresponding path program 18 times [2020-01-16 18:31:05,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:05,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550616575] [2020-01-16 18:31:05,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:06,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550616575] [2020-01-16 18:31:06,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:06,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:06,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001220607] [2020-01-16 18:31:06,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:06,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:06,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:06,163 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:31:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:06,301 INFO L93 Difference]: Finished difference Result 1370 states and 4840 transitions. [2020-01-16 18:31:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:06,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:06,306 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:06,306 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:31:06,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:31:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 782. [2020-01-16 18:31:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-01-16 18:31:06,339 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-01-16 18:31:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:06,339 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-01-16 18:31:06,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-01-16 18:31:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:06,342 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:06,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:06,342 INFO L426 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash 46993459, now seen corresponding path program 19 times [2020-01-16 18:31:06,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:06,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017960904] [2020-01-16 18:31:06,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:06,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017960904] [2020-01-16 18:31:06,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:06,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:06,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546160614] [2020-01-16 18:31:06,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:06,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:06,741 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:31:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:06,880 INFO L93 Difference]: Finished difference Result 1372 states and 4852 transitions. [2020-01-16 18:31:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:06,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:06,884 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:31:06,885 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:31:06,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:31:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-01-16 18:31:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:31:06,910 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:06,910 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:31:06,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:31:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:06,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:06,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:06,913 INFO L426 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1657934417, now seen corresponding path program 20 times [2020-01-16 18:31:06,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:06,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846736023] [2020-01-16 18:31:06,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:07,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846736023] [2020-01-16 18:31:07,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:07,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:07,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720120389] [2020-01-16 18:31:07,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:07,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:07,360 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:07,492 INFO L93 Difference]: Finished difference Result 1369 states and 4843 transitions. [2020-01-16 18:31:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:07,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:07,496 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:31:07,496 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:31:07,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:31:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 785. [2020-01-16 18:31:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:31:07,519 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:31:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:07,519 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:31:07,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:31:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:07,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:07,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:07,521 INFO L426 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:07,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1553444395, now seen corresponding path program 21 times [2020-01-16 18:31:07,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:07,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136992403] [2020-01-16 18:31:07,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:07,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-01-16 18:31:07,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136992403] [2020-01-16 18:31:07,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:07,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:07,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64595172] [2020-01-16 18:31:07,940 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:07,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:07,941 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:31:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:08,092 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2020-01-16 18:31:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:08,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:08,097 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:31:08,097 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:31:08,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:31:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 791. [2020-01-16 18:31:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:31:08,125 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:08,126 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:31:08,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:31:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:08,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:08,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:08,128 INFO L426 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1668437521, now seen corresponding path program 22 times [2020-01-16 18:31:08,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:08,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287700173] [2020-01-16 18:31:08,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:08,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-01-16 18:31:08,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287700173] [2020-01-16 18:31:08,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:08,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651038363] [2020-01-16 18:31:08,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:08,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:08,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:08,576 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:08,710 INFO L93 Difference]: Finished difference Result 1380 states and 4862 transitions. [2020-01-16 18:31:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:08,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:08,714 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:31:08,715 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:08,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-01-16 18:31:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:08,738 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:08,738 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:08,739 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:08,740 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:08,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] [2020-01-16 18:31:08,740 INFO L426 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1542941291, now seen corresponding path program 23 times [2020-01-16 18:31:08,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:08,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134458626] [2020-01-16 18:31:08,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:09,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134458626] [2020-01-16 18:31:09,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:09,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:09,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124376120] [2020-01-16 18:31:09,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:09,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:09,153 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:09,290 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:31:09,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:09,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:09,293 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:09,293 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:09,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:31:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:31:09,320 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:09,321 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:31:09,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:31:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:09,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:09,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:09,323 INFO L426 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 67999667, now seen corresponding path program 24 times [2020-01-16 18:31:09,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:09,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218612510] [2020-01-16 18:31:09,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:09,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218612510] [2020-01-16 18:31:09,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:09,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:09,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507556110] [2020-01-16 18:31:09,790 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:09,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:09,790 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:09,927 INFO L93 Difference]: Finished difference Result 1374 states and 4847 transitions. [2020-01-16 18:31:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:09,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:09,930 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:31:09,930 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:31:09,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:31:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 779. [2020-01-16 18:31:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:31:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3128 transitions. [2020-01-16 18:31:09,953 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3128 transitions. Word has length 25 [2020-01-16 18:31:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:09,953 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3128 transitions. [2020-01-16 18:31:09,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3128 transitions. [2020-01-16 18:31:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:09,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:09,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:09,955 INFO L426 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash -590066189, now seen corresponding path program 25 times [2020-01-16 18:31:09,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:09,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240821828] [2020-01-16 18:31:09,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:10,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-01-16 18:31:10,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240821828] [2020-01-16 18:31:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:10,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235105369] [2020-01-16 18:31:10,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:10,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:10,390 INFO L87 Difference]: Start difference. First operand 779 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:31:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:10,555 INFO L93 Difference]: Finished difference Result 1364 states and 4840 transitions. [2020-01-16 18:31:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:10,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:10,559 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:10,559 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:31:10,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:31:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 789. [2020-01-16 18:31:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:31:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-01-16 18:31:10,581 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-01-16 18:31:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:10,581 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-01-16 18:31:10,581 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-01-16 18:31:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:10,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:10,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:10,583 INFO L426 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 380185425, now seen corresponding path program 26 times [2020-01-16 18:31:10,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:10,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530498999] [2020-01-16 18:31:10,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530498999] [2020-01-16 18:31:11,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:11,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:11,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322422122] [2020-01-16 18:31:11,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:11,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:11,017 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:31:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:11,164 INFO L93 Difference]: Finished difference Result 1366 states and 4840 transitions. [2020-01-16 18:31:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:11,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:11,168 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:31:11,169 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:31:11,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:31:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-01-16 18:31:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-01-16 18:31:11,198 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-01-16 18:31:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:11,199 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-01-16 18:31:11,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-01-16 18:31:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:11,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:11,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:11,201 INFO L426 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1335967889, now seen corresponding path program 27 times [2020-01-16 18:31:11,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:11,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889109015] [2020-01-16 18:31:11,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:11,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889109015] [2020-01-16 18:31:11,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:11,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:11,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693861391] [2020-01-16 18:31:11,601 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:11,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:11,601 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:31:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:11,754 INFO L93 Difference]: Finished difference Result 1360 states and 4828 transitions. [2020-01-16 18:31:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:11,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:11,758 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:31:11,758 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:31:11,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:31:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:31:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:31:11,781 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:11,781 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:31:11,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:31:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:11,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:11,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:11,783 INFO L426 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1978244689, now seen corresponding path program 28 times [2020-01-16 18:31:11,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:11,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453108617] [2020-01-16 18:31:11,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:12,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-01-16 18:31:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453108617] [2020-01-16 18:31:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:12,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351105131] [2020-01-16 18:31:12,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:12,195 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:12,358 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-01-16 18:31:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:12,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:12,362 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:31:12,362 INFO L226 Difference]: Without dead ends: 1344 [2020-01-16 18:31:12,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-01-16 18:31:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-01-16 18:31:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-01-16 18:31:12,392 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-01-16 18:31:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:12,392 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-01-16 18:31:12,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-01-16 18:31:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:12,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:12,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:12,395 INFO L426 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:12,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 718810611, now seen corresponding path program 29 times [2020-01-16 18:31:12,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:12,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324879956] [2020-01-16 18:31:12,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:12,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-01-16 18:31:12,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324879956] [2020-01-16 18:31:12,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:12,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:12,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138260654] [2020-01-16 18:31:12,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:12,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:12,822 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:31:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:12,965 INFO L93 Difference]: Finished difference Result 1364 states and 4833 transitions. [2020-01-16 18:31:12,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:12,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:12,969 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:12,970 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:31:12,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:31:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-01-16 18:31:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:31:12,994 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:12,994 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:31:12,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:31:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:12,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:12,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:12,996 INFO L426 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1965215727, now seen corresponding path program 30 times [2020-01-16 18:31:12,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:12,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390377841] [2020-01-16 18:31:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:13,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-01-16 18:31:13,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390377841] [2020-01-16 18:31:13,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:13,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:13,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286786636] [2020-01-16 18:31:13,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:13,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:13,408 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:13,584 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-01-16 18:31:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:13,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:13,589 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:31:13,589 INFO L226 Difference]: Without dead ends: 1343 [2020-01-16 18:31:13,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-01-16 18:31:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 782. [2020-01-16 18:31:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-01-16 18:31:13,625 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-01-16 18:31:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:13,625 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-01-16 18:31:13,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-01-16 18:31:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:13,626 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:13,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:13,627 INFO L426 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1435037641, now seen corresponding path program 31 times [2020-01-16 18:31:13,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:13,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48215272] [2020-01-16 18:31:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:14,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48215272] [2020-01-16 18:31:14,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:14,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:14,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178304752] [2020-01-16 18:31:14,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:14,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:14,037 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:31:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,178 INFO L93 Difference]: Finished difference Result 1370 states and 4854 transitions. [2020-01-16 18:31:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:14,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,182 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:14,183 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:31:14,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:31:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 790. [2020-01-16 18:31:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3161 transitions. [2020-01-16 18:31:14,205 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3161 transitions. Word has length 25 [2020-01-16 18:31:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,206 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3161 transitions. [2020-01-16 18:31:14,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3161 transitions. [2020-01-16 18:31:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:14,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:14,207 INFO L426 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash -464786027, now seen corresponding path program 32 times [2020-01-16 18:31:14,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893156011] [2020-01-16 18:31:14,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:14,576 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:31:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:14,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893156011] [2020-01-16 18:31:14,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:14,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:14,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680338414] [2020-01-16 18:31:14,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:14,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:14,683 INFO L87 Difference]: Start difference. First operand 790 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:31:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,840 INFO L93 Difference]: Finished difference Result 1372 states and 4854 transitions. [2020-01-16 18:31:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:14,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,844 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:31:14,844 INFO L226 Difference]: Without dead ends: 1353 [2020-01-16 18:31:14,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-01-16 18:31:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 786. [2020-01-16 18:31:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3150 transitions. [2020-01-16 18:31:14,876 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3150 transitions. Word has length 25 [2020-01-16 18:31:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,876 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3150 transitions. [2020-01-16 18:31:14,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3150 transitions. [2020-01-16 18:31:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:14,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:14,878 INFO L426 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 48097297, now seen corresponding path program 33 times [2020-01-16 18:31:14,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332244117] [2020-01-16 18:31:14,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332244117] [2020-01-16 18:31:15,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:15,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:15,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811987215] [2020-01-16 18:31:15,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:15,270 INFO L87 Difference]: Start difference. First operand 786 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:31:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:15,443 INFO L93 Difference]: Finished difference Result 1369 states and 4848 transitions. [2020-01-16 18:31:15,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:15,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:15,447 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:31:15,447 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:31:15,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:31:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 790. [2020-01-16 18:31:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3157 transitions. [2020-01-16 18:31:15,470 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3157 transitions. Word has length 25 [2020-01-16 18:31:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:15,470 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3157 transitions. [2020-01-16 18:31:15,470 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3157 transitions. [2020-01-16 18:31:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:15,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:15,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:15,471 INFO L426 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1049858223, now seen corresponding path program 34 times [2020-01-16 18:31:15,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:15,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710563214] [2020-01-16 18:31:15,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:15,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-01-16 18:31:15,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710563214] [2020-01-16 18:31:15,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:15,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092172898] [2020-01-16 18:31:15,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:15,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:15,885 INFO L87 Difference]: Start difference. First operand 790 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:31:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:16,027 INFO L93 Difference]: Finished difference Result 1370 states and 4846 transitions. [2020-01-16 18:31:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:16,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:16,031 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:16,031 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:31:16,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:31:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 786. [2020-01-16 18:31:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-01-16 18:31:16,053 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:16,053 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-01-16 18:31:16,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-01-16 18:31:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:16,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:16,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:16,055 INFO L426 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash 525031607, now seen corresponding path program 35 times [2020-01-16 18:31:16,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:16,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105334984] [2020-01-16 18:31:16,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:16,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105334984] [2020-01-16 18:31:16,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:16,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:16,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665881441] [2020-01-16 18:31:16,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:16,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:16,495 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:16,639 INFO L93 Difference]: Finished difference Result 1374 states and 4855 transitions. [2020-01-16 18:31:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:16,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:16,644 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:31:16,644 INFO L226 Difference]: Without dead ends: 1359 [2020-01-16 18:31:16,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-01-16 18:31:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 791. [2020-01-16 18:31:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:31:16,667 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:16,668 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:31:16,668 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:31:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:16,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:16,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:16,670 INFO L426 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1062887185, now seen corresponding path program 36 times [2020-01-16 18:31:16,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:16,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115748979] [2020-01-16 18:31:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:17,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115748979] [2020-01-16 18:31:17,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:17,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:17,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955334804] [2020-01-16 18:31:17,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:17,173 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:17,300 INFO L93 Difference]: Finished difference Result 1373 states and 4848 transitions. [2020-01-16 18:31:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:17,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:17,305 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:31:17,305 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:31:17,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:31:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 782. [2020-01-16 18:31:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-01-16 18:31:17,327 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-01-16 18:31:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:17,328 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-01-16 18:31:17,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-01-16 18:31:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:17,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:17,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:17,330 INFO L426 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 68510711, now seen corresponding path program 37 times [2020-01-16 18:31:17,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:17,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40191551] [2020-01-16 18:31:17,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:17,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-01-16 18:31:17,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40191551] [2020-01-16 18:31:17,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:17,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:17,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361909893] [2020-01-16 18:31:17,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:17,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:17,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:17,742 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:31:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:17,912 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-01-16 18:31:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:17,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:17,915 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:31:17,916 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:31:17,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:31:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 788. [2020-01-16 18:31:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:31:17,938 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:17,938 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:31:17,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:31:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:17,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:17,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:17,941 INFO L426 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1049265429, now seen corresponding path program 38 times [2020-01-16 18:31:17,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:17,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206526536] [2020-01-16 18:31:17,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:18,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206526536] [2020-01-16 18:31:18,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:18,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404938311] [2020-01-16 18:31:18,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:18,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:18,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:18,334 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:18,472 INFO L93 Difference]: Finished difference Result 1358 states and 4818 transitions. [2020-01-16 18:31:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:18,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:18,476 INFO L225 Difference]: With dead ends: 1358 [2020-01-16 18:31:18,476 INFO L226 Difference]: Without dead ends: 1343 [2020-01-16 18:31:18,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-01-16 18:31:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 785. [2020-01-16 18:31:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:31:18,501 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:31:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:18,501 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:31:18,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:31:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:18,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:18,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:18,503 INFO L426 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -374388429, now seen corresponding path program 39 times [2020-01-16 18:31:18,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:18,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393578607] [2020-01-16 18:31:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,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-01-16 18:31:18,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393578607] [2020-01-16 18:31:18,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:18,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091532579] [2020-01-16 18:31:18,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:18,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:18,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:18,919 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:31:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,082 INFO L93 Difference]: Finished difference Result 1362 states and 4827 transitions. [2020-01-16 18:31:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:19,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,086 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:31:19,086 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:31:19,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:31:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 789. [2020-01-16 18:31:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:31:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:31:19,113 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:31:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,113 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:31:19,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:31:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:19,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:19,115 INFO L426 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,116 INFO L82 PathProgramCache]: Analyzing trace with hash 627372497, now seen corresponding path program 40 times [2020-01-16 18:31:19,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524589551] [2020-01-16 18:31:19,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:19,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524589551] [2020-01-16 18:31:19,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:19,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:19,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105331625] [2020-01-16 18:31:19,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:19,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:19,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:19,607 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:31:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,746 INFO L93 Difference]: Finished difference Result 1363 states and 4825 transitions. [2020-01-16 18:31:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:19,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,749 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:31:19,749 INFO L226 Difference]: Without dead ends: 1345 [2020-01-16 18:31:19,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-01-16 18:31:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 785. [2020-01-16 18:31:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:19,783 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,783 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:19,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:19,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,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] [2020-01-16 18:31:19,786 INFO L426 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2039083063, now seen corresponding path program 41 times [2020-01-16 18:31:19,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803264367] [2020-01-16 18:31:19,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:20,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803264367] [2020-01-16 18:31:20,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:20,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:20,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504013314] [2020-01-16 18:31:20,232 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:20,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:20,233 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:20,376 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-01-16 18:31:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:20,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:20,380 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:31:20,380 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:31:20,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:31:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:31:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:31:20,403 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:20,403 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:31:20,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:31:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:20,405 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:20,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:20,405 INFO L426 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 965997683, now seen corresponding path program 42 times [2020-01-16 18:31:20,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:20,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264699346] [2020-01-16 18:31:20,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:20,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264699346] [2020-01-16 18:31:20,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:20,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:20,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481329424] [2020-01-16 18:31:20,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:20,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:20,903 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:21,042 INFO L93 Difference]: Finished difference Result 1361 states and 4818 transitions. [2020-01-16 18:31:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:21,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:21,046 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:31:21,046 INFO L226 Difference]: Without dead ends: 1341 [2020-01-16 18:31:21,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-01-16 18:31:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 782. [2020-01-16 18:31:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:31:21,082 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:31:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:21,082 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:31:21,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:31:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:21,088 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:21,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:21,088 INFO L426 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1338386193, now seen corresponding path program 43 times [2020-01-16 18:31:21,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:21,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104223623] [2020-01-16 18:31:21,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:21,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104223623] [2020-01-16 18:31:21,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:21,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:21,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098511577] [2020-01-16 18:31:21,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:21,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:21,492 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:31:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:21,665 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-01-16 18:31:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:21,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:21,669 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:31:21,670 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:31:21,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:31:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-01-16 18:31:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:31:21,693 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:31:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:21,693 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:31:21,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:31:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:21,695 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:21,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:21,695 INFO L426 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1345640145, now seen corresponding path program 44 times [2020-01-16 18:31:21,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:21,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34154536] [2020-01-16 18:31:21,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34154536] [2020-01-16 18:31:22,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:22,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653301984] [2020-01-16 18:31:22,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:22,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:22,186 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:31:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,341 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-01-16 18:31:22,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:22,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,345 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:31:22,345 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:31:22,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:31:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-01-16 18:31:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:22,383 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,384 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:22,384 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:22,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:22,385 INFO L426 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:22,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1862489515, now seen corresponding path program 45 times [2020-01-16 18:31:22,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273231442] [2020-01-16 18:31:22,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273231442] [2020-01-16 18:31:22,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:22,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893436602] [2020-01-16 18:31:22,772 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:22,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:22,772 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,951 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:31:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:22,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,955 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:22,955 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:31:22,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:31:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 790. [2020-01-16 18:31:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:31:22,978 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:31:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,978 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:31:22,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:31:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:22,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:22,980 INFO L426 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1324633937, now seen corresponding path program 46 times [2020-01-16 18:31:22,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989440414] [2020-01-16 18:31:22,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:23,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989440414] [2020-01-16 18:31:23,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:23,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:23,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44012452] [2020-01-16 18:31:23,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:23,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:23,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:23,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:23,384 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:31:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:23,569 INFO L93 Difference]: Finished difference Result 1369 states and 4835 transitions. [2020-01-16 18:31:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:23,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:23,573 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:31:23,573 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:31:23,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:31:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:31:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:31:23,596 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:31:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:23,596 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:31:23,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:31:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:23,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:23,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:23,597 INFO L426 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1851986411, now seen corresponding path program 47 times [2020-01-16 18:31:23,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:23,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488276917] [2020-01-16 18:31:23,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:24,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488276917] [2020-01-16 18:31:24,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:24,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:24,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566893124] [2020-01-16 18:31:24,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:24,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:24,004 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:31:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:24,158 INFO L93 Difference]: Finished difference Result 1362 states and 4821 transitions. [2020-01-16 18:31:24,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:24,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:24,163 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:31:24,163 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:31:24,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:31:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-01-16 18:31:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:31:24,186 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:31:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:24,186 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:31:24,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:31:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:24,187 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:24,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:24,187 INFO L426 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1369895505, now seen corresponding path program 48 times [2020-01-16 18:31:24,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:24,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385797827] [2020-01-16 18:31:24,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:24,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385797827] [2020-01-16 18:31:24,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:24,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:24,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161873102] [2020-01-16 18:31:24,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:24,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:24,596 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:31:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:24,770 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-01-16 18:31:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:24,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:24,776 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:24,776 INFO L226 Difference]: Without dead ends: 1341 [2020-01-16 18:31:24,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-01-16 18:31:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 779. [2020-01-16 18:31:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:31:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3125 transitions. [2020-01-16 18:31:24,798 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3125 transitions. Word has length 25 [2020-01-16 18:31:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:24,798 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3125 transitions. [2020-01-16 18:31:24,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3125 transitions. [2020-01-16 18:31:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:24,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:24,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:24,800 INFO L426 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1224707533, now seen corresponding path program 49 times [2020-01-16 18:31:24,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:24,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737495573] [2020-01-16 18:31:24,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,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-01-16 18:31:25,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737495573] [2020-01-16 18:31:25,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:25,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726399592] [2020-01-16 18:31:25,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:25,298 INFO L87 Difference]: Start difference. First operand 779 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:31:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:25,445 INFO L93 Difference]: Finished difference Result 1388 states and 4908 transitions. [2020-01-16 18:31:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:25,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:25,450 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:31:25,450 INFO L226 Difference]: Without dead ends: 1375 [2020-01-16 18:31:25,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-01-16 18:31:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 791. [2020-01-16 18:31:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-01-16 18:31:25,496 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-01-16 18:31:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:25,496 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-01-16 18:31:25,496 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-01-16 18:31:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:25,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:25,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:25,498 INFO L426 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash -254455919, now seen corresponding path program 50 times [2020-01-16 18:31:25,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:25,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812480166] [2020-01-16 18:31:25,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:25,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812480166] [2020-01-16 18:31:25,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:25,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862832069] [2020-01-16 18:31:25,890 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:25,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:25,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:25,891 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:31:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:26,035 INFO L93 Difference]: Finished difference Result 1390 states and 4908 transitions. [2020-01-16 18:31:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:26,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:26,039 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:31:26,039 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:31:26,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:31:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-01-16 18:31:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3155 transitions. [2020-01-16 18:31:26,063 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:26,063 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3155 transitions. [2020-01-16 18:31:26,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3155 transitions. [2020-01-16 18:31:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:26,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:26,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:26,065 INFO L426 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1667606673, now seen corresponding path program 51 times [2020-01-16 18:31:26,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:26,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87488097] [2020-01-16 18:31:26,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:26,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87488097] [2020-01-16 18:31:26,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:26,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:26,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914476702] [2020-01-16 18:31:26,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:26,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:26,469 INFO L87 Difference]: Start difference. First operand 787 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:26,627 INFO L93 Difference]: Finished difference Result 1389 states and 4906 transitions. [2020-01-16 18:31:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:26,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:26,630 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:31:26,631 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:31:26,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:31:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-01-16 18:31:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-01-16 18:31:26,657 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-01-16 18:31:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:26,657 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-01-16 18:31:26,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-01-16 18:31:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:26,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:26,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:26,659 INFO L426 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -676348851, now seen corresponding path program 52 times [2020-01-16 18:31:26,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:26,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446455545] [2020-01-16 18:31:26,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:27,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-01-16 18:31:27,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446455545] [2020-01-16 18:31:27,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:27,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:27,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297193638] [2020-01-16 18:31:27,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:27,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:27,070 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:31:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:27,275 INFO L93 Difference]: Finished difference Result 1392 states and 4908 transitions. [2020-01-16 18:31:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:27,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:27,279 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:31:27,279 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:31:27,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:31:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-01-16 18:31:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-01-16 18:31:27,304 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-01-16 18:31:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:27,305 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-01-16 18:31:27,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-01-16 18:31:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:27,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:27,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:27,306 INFO L426 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash 409765491, now seen corresponding path program 53 times [2020-01-16 18:31:27,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:27,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428528422] [2020-01-16 18:31:27,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:27,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428528422] [2020-01-16 18:31:27,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:27,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:27,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930919371] [2020-01-16 18:31:27,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:27,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:27,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:27,712 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:31:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:27,875 INFO L93 Difference]: Finished difference Result 1395 states and 4916 transitions. [2020-01-16 18:31:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:27,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:27,880 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:31:27,880 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:31:27,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:31:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 793. [2020-01-16 18:31:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:31:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3162 transitions. [2020-01-16 18:31:27,904 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3162 transitions. Word has length 25 [2020-01-16 18:31:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:27,904 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3162 transitions. [2020-01-16 18:31:27,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3162 transitions. [2020-01-16 18:31:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:27,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:27,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:27,905 INFO L426 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -663319889, now seen corresponding path program 54 times [2020-01-16 18:31:27,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:27,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542040758] [2020-01-16 18:31:27,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:28,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542040758] [2020-01-16 18:31:28,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:28,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428762379] [2020-01-16 18:31:28,319 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:28,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:28,320 INFO L87 Difference]: Start difference. First operand 793 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:31:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:28,474 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-01-16 18:31:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:28,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:28,478 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:31:28,478 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:31:28,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:31:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 783. [2020-01-16 18:31:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:31:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3140 transitions. [2020-01-16 18:31:28,510 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3140 transitions. Word has length 25 [2020-01-16 18:31:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:28,510 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3140 transitions. [2020-01-16 18:31:28,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3140 transitions. [2020-01-16 18:31:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:28,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:28,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:28,513 INFO L426 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1647193259, now seen corresponding path program 55 times [2020-01-16 18:31:28,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:28,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84417618] [2020-01-16 18:31:28,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:28,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84417618] [2020-01-16 18:31:28,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:28,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912282097] [2020-01-16 18:31:28,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:28,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:28,906 INFO L87 Difference]: Start difference. First operand 783 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:31:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,073 INFO L93 Difference]: Finished difference Result 1385 states and 4897 transitions. [2020-01-16 18:31:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:29,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,077 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:31:29,077 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:31:29,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:31:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:31:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-01-16 18:31:29,100 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-01-16 18:31:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,100 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-01-16 18:31:29,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-01-16 18:31:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:29,101 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:29,102 INFO L426 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash -676941645, now seen corresponding path program 56 times [2020-01-16 18:31:29,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549103737] [2020-01-16 18:31:29,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:29,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549103737] [2020-01-16 18:31:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:29,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310900427] [2020-01-16 18:31:29,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:29,497 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:31:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,645 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-01-16 18:31:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:29,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,649 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:31:29,649 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:31:29,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:31:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:31:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-01-16 18:31:29,672 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-01-16 18:31:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,672 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-01-16 18:31:29,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-01-16 18:31:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:29,673 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:29,674 INFO L426 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,674 INFO L82 PathProgramCache]: Analyzing trace with hash -164058321, now seen corresponding path program 57 times [2020-01-16 18:31:29,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84774517] [2020-01-16 18:31:29,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84774517] [2020-01-16 18:31:30,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:30,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:30,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146031359] [2020-01-16 18:31:30,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:30,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:30,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:30,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:30,088 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:31:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:30,256 INFO L93 Difference]: Finished difference Result 1384 states and 4891 transitions. [2020-01-16 18:31:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:30,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:30,260 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:31:30,260 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:31:30,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:31:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 791. [2020-01-16 18:31:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:31:30,283 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:31:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:30,283 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:31:30,283 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:31:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:30,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:30,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:30,285 INFO L426 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 837702605, now seen corresponding path program 58 times [2020-01-16 18:31:30,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:30,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944658343] [2020-01-16 18:31:30,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:30,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944658343] [2020-01-16 18:31:30,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:30,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:30,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666960080] [2020-01-16 18:31:30,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:30,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:30,682 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:31:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:30,829 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-01-16 18:31:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:30,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:30,834 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:31:30,834 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:31:30,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:31:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 787. [2020-01-16 18:31:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:31:30,855 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:31:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:30,855 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:31:30,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:31:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:30,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:30,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:30,857 INFO L426 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 312875989, now seen corresponding path program 59 times [2020-01-16 18:31:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:30,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541043218] [2020-01-16 18:31:30,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:31,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541043218] [2020-01-16 18:31:31,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:31,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:31,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314104363] [2020-01-16 18:31:31,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:31,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:31,265 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:31:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:31,449 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:31:31,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:31,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:31,454 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:31:31,454 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:31:31,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:31:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-01-16 18:31:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:31:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3156 transitions. [2020-01-16 18:31:31,484 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3156 transitions. Word has length 25 [2020-01-16 18:31:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:31,484 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3156 transitions. [2020-01-16 18:31:31,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3156 transitions. [2020-01-16 18:31:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:31,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:31,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:31,486 INFO L426 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 850731567, now seen corresponding path program 60 times [2020-01-16 18:31:31,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:31,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7315067] [2020-01-16 18:31:31,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:31,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7315067] [2020-01-16 18:31:31,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:31,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:31,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519795298] [2020-01-16 18:31:31,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:31,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:31,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:31,905 INFO L87 Difference]: Start difference. First operand 792 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:31:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:32,052 INFO L93 Difference]: Finished difference Result 1388 states and 4891 transitions. [2020-01-16 18:31:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:32,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:32,055 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:31:32,056 INFO L226 Difference]: Without dead ends: 1365 [2020-01-16 18:31:32,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-01-16 18:31:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 783. [2020-01-16 18:31:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:31:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3136 transitions. [2020-01-16 18:31:32,078 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3136 transitions. Word has length 25 [2020-01-16 18:31:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:32,078 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3136 transitions. [2020-01-16 18:31:32,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3136 transitions. [2020-01-16 18:31:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:32,079 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:32,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:32,079 INFO L426 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1359903445, now seen corresponding path program 61 times [2020-01-16 18:31:32,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:32,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65046630] [2020-01-16 18:31:32,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:32,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65046630] [2020-01-16 18:31:32,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:32,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:32,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442825690] [2020-01-16 18:31:32,489 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:32,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:32,490 INFO L87 Difference]: Start difference. First operand 783 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:31:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:32,653 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-01-16 18:31:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:32,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:32,657 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:31:32,657 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:31:32,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:31:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-01-16 18:31:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:31:32,681 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:31:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:32,681 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:31:32,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:31:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:32,683 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:32,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:32,683 INFO L426 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1943806029, now seen corresponding path program 62 times [2020-01-16 18:31:32,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:32,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185103698] [2020-01-16 18:31:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:33,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185103698] [2020-01-16 18:31:33,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:33,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:33,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632418115] [2020-01-16 18:31:33,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:33,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:33,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:33,103 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:31:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:33,259 INFO L93 Difference]: Finished difference Result 1390 states and 4899 transitions. [2020-01-16 18:31:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:33,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:33,263 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:31:33,264 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:31:33,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:31:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:31:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:31:33,286 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:31:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:33,286 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:31:33,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:31:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:33,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:33,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:33,288 INFO L426 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1009029773, now seen corresponding path program 63 times [2020-01-16 18:31:33,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:33,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681632029] [2020-01-16 18:31:33,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:33,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681632029] [2020-01-16 18:31:33,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:33,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:33,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727770448] [2020-01-16 18:31:33,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:33,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:33,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:33,700 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:31:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:33,855 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-01-16 18:31:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:33,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:33,859 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:31:33,859 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:31:33,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:31:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:31:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-01-16 18:31:33,881 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-01-16 18:31:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:33,881 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-01-16 18:31:33,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-01-16 18:31:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:33,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:33,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:33,882 INFO L426 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash -7268847, now seen corresponding path program 64 times [2020-01-16 18:31:33,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:33,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615393359] [2020-01-16 18:31:33,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:34,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-01-16 18:31:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615393359] [2020-01-16 18:31:34,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:34,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:34,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778581423] [2020-01-16 18:31:34,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:34,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:34,298 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:31:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:34,435 INFO L93 Difference]: Finished difference Result 1386 states and 4887 transitions. [2020-01-16 18:31:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:34,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:34,439 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:31:34,439 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:31:34,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:31:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:31:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:31:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3143 transitions. [2020-01-16 18:31:34,461 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3143 transitions. Word has length 25 [2020-01-16 18:31:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:34,461 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3143 transitions. [2020-01-16 18:31:34,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3143 transitions. [2020-01-16 18:31:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:34,463 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:34,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:34,463 INFO L426 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash -953988395, now seen corresponding path program 65 times [2020-01-16 18:31:34,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:34,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826300735] [2020-01-16 18:31:34,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:34,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826300735] [2020-01-16 18:31:34,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:34,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:34,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506074698] [2020-01-16 18:31:34,868 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:34,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:34,868 INFO L87 Difference]: Start difference. First operand 787 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:31:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:35,041 INFO L93 Difference]: Finished difference Result 1392 states and 4900 transitions. [2020-01-16 18:31:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:35,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:35,045 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:31:35,045 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:31:35,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:31:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-01-16 18:31:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:31:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3152 transitions. [2020-01-16 18:31:35,067 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:35,067 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3152 transitions. [2020-01-16 18:31:35,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3152 transitions. [2020-01-16 18:31:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:35,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:35,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:35,069 INFO L426 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash 656952563, now seen corresponding path program 66 times [2020-01-16 18:31:35,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:35,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417728414] [2020-01-16 18:31:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:35,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417728414] [2020-01-16 18:31:35,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:35,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:35,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858715593] [2020-01-16 18:31:35,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:35,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:35,456 INFO L87 Difference]: Start difference. First operand 792 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:35,628 INFO L93 Difference]: Finished difference Result 1390 states and 4891 transitions. [2020-01-16 18:31:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:35,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:35,632 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:31:35,632 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:31:35,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:31:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-01-16 18:31:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:31:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-01-16 18:31:35,654 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-01-16 18:31:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:35,654 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-01-16 18:31:35,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-01-16 18:31:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:35,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:35,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:35,655 INFO L426 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:35,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1029341073, now seen corresponding path program 67 times [2020-01-16 18:31:35,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:35,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382447215] [2020-01-16 18:31:35,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:36,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382447215] [2020-01-16 18:31:36,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:36,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:36,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765156220] [2020-01-16 18:31:36,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:36,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:36,083 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:31:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:36,215 INFO L93 Difference]: Finished difference Result 1399 states and 4924 transitions. [2020-01-16 18:31:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:36,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:36,219 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:31:36,219 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:31:36,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:31:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 794. [2020-01-16 18:31:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:31:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:31:36,241 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:31:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:36,241 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:31:36,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:31:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:36,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:36,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:36,243 INFO L426 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -43744307, now seen corresponding path program 68 times [2020-01-16 18:31:36,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:36,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832119616] [2020-01-16 18:31:36,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:36,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832119616] [2020-01-16 18:31:36,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:36,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:36,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916259868] [2020-01-16 18:31:36,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:36,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:36,620 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:31:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:36,756 INFO L93 Difference]: Finished difference Result 1400 states and 4920 transitions. [2020-01-16 18:31:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:36,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:36,760 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:31:36,760 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:31:36,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:31:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 788. [2020-01-16 18:31:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:31:36,782 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:36,782 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:31:36,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:31:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:36,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:36,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:36,783 INFO L426 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash -571096781, now seen corresponding path program 69 times [2020-01-16 18:31:36,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:36,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432441767] [2020-01-16 18:31:36,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:37,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432441767] [2020-01-16 18:31:37,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:37,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685948093] [2020-01-16 18:31:37,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:37,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:37,192 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,320 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-01-16 18:31:37,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:37,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,324 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:31:37,324 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:31:37,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:31:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 793. [2020-01-16 18:31:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:31:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-01-16 18:31:37,346 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-01-16 18:31:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,346 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-01-16 18:31:37,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-01-16 18:31:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:37,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:37,347 INFO L426 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -33241203, now seen corresponding path program 70 times [2020-01-16 18:31:37,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439095303] [2020-01-16 18:31:37,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,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-01-16 18:31:37,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439095303] [2020-01-16 18:31:37,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:37,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882947436] [2020-01-16 18:31:37,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:37,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:37,766 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:31:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,909 INFO L93 Difference]: Finished difference Result 1395 states and 4905 transitions. [2020-01-16 18:31:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:37,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,912 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:31:37,913 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:31:37,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:31:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 788. [2020-01-16 18:31:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3141 transitions. [2020-01-16 18:31:37,934 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,935 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3141 transitions. [2020-01-16 18:31:37,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3141 transitions. [2020-01-16 18:31:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:37,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:37,936 INFO L426 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -550090573, now seen corresponding path program 71 times [2020-01-16 18:31:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140398869] [2020-01-16 18:31:37,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140398869] [2020-01-16 18:31:38,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:38,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:38,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234709523] [2020-01-16 18:31:38,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:38,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:38,334 INFO L87 Difference]: Start difference. First operand 788 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:38,487 INFO L93 Difference]: Finished difference Result 1398 states and 4911 transitions. [2020-01-16 18:31:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:38,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:38,491 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:31:38,492 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:31:38,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:31:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 793. [2020-01-16 18:31:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:31:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3150 transitions. [2020-01-16 18:31:38,516 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3150 transitions. Word has length 25 [2020-01-16 18:31:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:38,516 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3150 transitions. [2020-01-16 18:31:38,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3150 transitions. [2020-01-16 18:31:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:38,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:38,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:38,517 INFO L426 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1060850385, now seen corresponding path program 72 times [2020-01-16 18:31:38,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:38,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379091161] [2020-01-16 18:31:38,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:38,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379091161] [2020-01-16 18:31:38,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:38,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:38,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254495747] [2020-01-16 18:31:38,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:38,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:38,912 INFO L87 Difference]: Start difference. First operand 793 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:31:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,042 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-01-16 18:31:39,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:39,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,046 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:31:39,046 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:31:39,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:31:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 779. [2020-01-16 18:31:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:31:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3122 transitions. [2020-01-16 18:31:39,068 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3122 transitions. Word has length 25 [2020-01-16 18:31:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,068 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3122 transitions. [2020-01-16 18:31:39,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3122 transitions. [2020-01-16 18:31:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:39,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:39,070 INFO L426 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 66685201, now seen corresponding path program 73 times [2020-01-16 18:31:39,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789015967] [2020-01-16 18:31:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:39,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789015967] [2020-01-16 18:31:39,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:39,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:39,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103217030] [2020-01-16 18:31:39,478 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:39,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:39,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:39,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:39,478 INFO L87 Difference]: Start difference. First operand 779 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:31:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,614 INFO L93 Difference]: Finished difference Result 1362 states and 4829 transitions. [2020-01-16 18:31:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:39,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,618 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:31:39,618 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:31:39,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:31:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-01-16 18:31:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:31:39,640 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,640 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:31:39,640 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:31:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:39,641 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:39,641 INFO L426 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1047439919, now seen corresponding path program 74 times [2020-01-16 18:31:39,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834529955] [2020-01-16 18:31:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834529955] [2020-01-16 18:31:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:40,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412149165] [2020-01-16 18:31:40,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:40,035 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:40,187 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-01-16 18:31:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:40,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:40,191 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:31:40,191 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:31:40,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:31:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-01-16 18:31:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:31:40,212 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:31:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:40,212 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:31:40,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:31:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:40,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:40,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:40,214 INFO L426 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1992719279, now seen corresponding path program 75 times [2020-01-16 18:31:40,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:40,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720044820] [2020-01-16 18:31:40,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:40,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720044820] [2020-01-16 18:31:40,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:40,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:40,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23360584] [2020-01-16 18:31:40,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:40,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:40,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:40,594 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:31:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:40,725 INFO L93 Difference]: Finished difference Result 1367 states and 4837 transitions. [2020-01-16 18:31:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:40,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:40,729 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:31:40,730 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:31:40,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:31:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-01-16 18:31:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:31:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:31:40,762 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:31:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:40,763 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:31:40,763 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:31:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:40,764 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:40,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:40,764 INFO L426 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1310990195, now seen corresponding path program 76 times [2020-01-16 18:31:40,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:40,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803674888] [2020-01-16 18:31:40,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:41,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-01-16 18:31:41,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803674888] [2020-01-16 18:31:41,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:41,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:41,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789807197] [2020-01-16 18:31:41,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:41,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:41,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:41,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:41,149 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:31:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:41,301 INFO L93 Difference]: Finished difference Result 1370 states and 4839 transitions. [2020-01-16 18:31:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:41,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:41,305 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:41,305 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:31:41,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:31:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:31:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:41,328 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:41,329 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:41,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:41,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:41,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:41,330 INFO L426 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1711661329, now seen corresponding path program 77 times [2020-01-16 18:31:41,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:41,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247483555] [2020-01-16 18:31:41,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:41,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247483555] [2020-01-16 18:31:41,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:41,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:41,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882236506] [2020-01-16 18:31:41,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:41,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:41,750 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:41,886 INFO L93 Difference]: Finished difference Result 1364 states and 4827 transitions. [2020-01-16 18:31:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:41,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:41,890 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:41,890 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:31:41,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:31:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:31:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:31:41,913 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:41,913 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:31:41,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:31:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:41,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:41,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:41,914 INFO L426 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash -972365009, now seen corresponding path program 78 times [2020-01-16 18:31:41,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:41,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251925356] [2020-01-16 18:31:41,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,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-01-16 18:31:42,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251925356] [2020-01-16 18:31:42,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:42,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949797804] [2020-01-16 18:31:42,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:42,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:42,303 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:42,456 INFO L93 Difference]: Finished difference Result 1368 states and 4832 transitions. [2020-01-16 18:31:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:42,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:42,460 INFO L225 Difference]: With dead ends: 1368 [2020-01-16 18:31:42,460 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:31:42,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:31:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-01-16 18:31:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:31:42,490 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:31:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:42,490 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:31:42,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:31:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:42,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:42,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:42,492 INFO L426 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -355800525, now seen corresponding path program 79 times [2020-01-16 18:31:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:42,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278480805] [2020-01-16 18:31:42,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:42,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278480805] [2020-01-16 18:31:42,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152553421] [2020-01-16 18:31:42,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:42,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:42,887 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:31:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:43,042 INFO L93 Difference]: Finished difference Result 1360 states and 4822 transitions. [2020-01-16 18:31:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:43,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:43,046 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:31:43,046 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:31:43,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:31:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:31:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:31:43,068 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:31:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,069 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:31:43,069 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:31:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:43,071 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:43,071 INFO L426 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,071 INFO L82 PathProgramCache]: Analyzing trace with hash 624954193, now seen corresponding path program 80 times [2020-01-16 18:31:43,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082162921] [2020-01-16 18:31:43,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:43,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082162921] [2020-01-16 18:31:43,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:43,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638791055] [2020-01-16 18:31:43,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:43,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:43,451 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:31:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:43,634 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-01-16 18:31:43,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:43,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:43,639 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:31:43,639 INFO L226 Difference]: Without dead ends: 1344 [2020-01-16 18:31:43,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-01-16 18:31:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-01-16 18:31:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:43,687 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,687 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:43,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:43,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:43,690 INFO L426 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -798699665, now seen corresponding path program 81 times [2020-01-16 18:31:43,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220227976] [2020-01-16 18:31:43,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,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-01-16 18:31:44,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220227976] [2020-01-16 18:31:44,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:44,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119580567] [2020-01-16 18:31:44,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:44,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:44,150 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:44,291 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-01-16 18:31:44,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:44,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:44,294 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:31:44,295 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:31:44,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:31:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 789. [2020-01-16 18:31:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:31:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:31:44,316 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:31:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:44,316 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:31:44,316 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:31:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:44,317 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:44,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:44,318 INFO L426 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:44,318 INFO L82 PathProgramCache]: Analyzing trace with hash 203061261, now seen corresponding path program 82 times [2020-01-16 18:31:44,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:44,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683473359] [2020-01-16 18:31:44,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:44,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683473359] [2020-01-16 18:31:44,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:44,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124797179] [2020-01-16 18:31:44,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:44,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:44,699 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:31:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:44,833 INFO L93 Difference]: Finished difference Result 1364 states and 4824 transitions. [2020-01-16 18:31:44,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:44,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:44,837 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:44,837 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:31:44,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:31:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-01-16 18:31:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:31:44,859 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:31:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:44,860 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:31:44,860 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:31:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:44,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:44,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:44,861 INFO L426 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1614771827, now seen corresponding path program 83 times [2020-01-16 18:31:44,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:44,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578295547] [2020-01-16 18:31:44,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:45,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578295547] [2020-01-16 18:31:45,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:45,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:45,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085571042] [2020-01-16 18:31:45,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:45,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:45,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:45,238 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:31:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,370 INFO L93 Difference]: Finished difference Result 1360 states and 4816 transitions. [2020-01-16 18:31:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:45,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,373 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:31:45,374 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:31:45,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:31:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 788. [2020-01-16 18:31:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:31:45,395 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:31:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,395 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:31:45,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:31:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:45,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:45,396 INFO L426 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 541686447, now seen corresponding path program 84 times [2020-01-16 18:31:45,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558298843] [2020-01-16 18:31:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:45,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558298843] [2020-01-16 18:31:45,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:45,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:45,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575448216] [2020-01-16 18:31:45,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:45,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:45,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:45,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:45,788 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:31:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,946 INFO L93 Difference]: Finished difference Result 1362 states and 4817 transitions. [2020-01-16 18:31:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:45,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,950 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:31:45,950 INFO L226 Difference]: Without dead ends: 1342 [2020-01-16 18:31:45,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-01-16 18:31:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 782. [2020-01-16 18:31:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-01-16 18:31:45,972 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-01-16 18:31:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,972 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-01-16 18:31:45,973 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-01-16 18:31:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:45,974 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:45,975 INFO L426 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1147747827, now seen corresponding path program 85 times [2020-01-16 18:31:45,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800531965] [2020-01-16 18:31:45,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:46,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800531965] [2020-01-16 18:31:46,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:46,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:46,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880482089] [2020-01-16 18:31:46,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:46,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:46,377 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:31:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:46,512 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-01-16 18:31:46,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:46,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:46,516 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:31:46,516 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:31:46,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:31:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 790. [2020-01-16 18:31:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-01-16 18:31:46,538 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:46,539 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-01-16 18:31:46,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-01-16 18:31:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:46,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:46,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:46,540 INFO L426 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2139005649, now seen corresponding path program 86 times [2020-01-16 18:31:46,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:46,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164625602] [2020-01-16 18:31:46,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164625602] [2020-01-16 18:31:46,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285214515] [2020-01-16 18:31:46,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:46,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:46,944 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:47,099 INFO L93 Difference]: Finished difference Result 1376 states and 4853 transitions. [2020-01-16 18:31:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:47,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:47,103 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:31:47,104 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:31:47,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:31:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 786. [2020-01-16 18:31:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3141 transitions. [2020-01-16 18:31:47,127 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:47,127 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3141 transitions. [2020-01-16 18:31:47,127 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3141 transitions. [2020-01-16 18:31:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:47,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:47,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:47,129 INFO L426 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1221185391, now seen corresponding path program 87 times [2020-01-16 18:31:47,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:47,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295414110] [2020-01-16 18:31:47,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:47,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295414110] [2020-01-16 18:31:47,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:47,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:47,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754373893] [2020-01-16 18:31:47,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:47,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:47,543 INFO L87 Difference]: Start difference. First operand 786 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:47,698 INFO L93 Difference]: Finished difference Result 1371 states and 4843 transitions. [2020-01-16 18:31:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:47,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:47,702 INFO L225 Difference]: With dead ends: 1371 [2020-01-16 18:31:47,703 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:47,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-01-16 18:31:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:31:47,725 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:31:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:47,725 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:31:47,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:31:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:47,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:47,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:47,727 INFO L426 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -219424465, now seen corresponding path program 88 times [2020-01-16 18:31:47,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:47,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089905084] [2020-01-16 18:31:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:48,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089905084] [2020-01-16 18:31:48,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:48,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:48,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744751459] [2020-01-16 18:31:48,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:48,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:48,125 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:31:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:48,291 INFO L93 Difference]: Finished difference Result 1372 states and 4841 transitions. [2020-01-16 18:31:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:48,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:48,294 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:31:48,295 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:31:48,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:31:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 786. [2020-01-16 18:31:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:31:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-01-16 18:31:48,317 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-01-16 18:31:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:48,317 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-01-16 18:31:48,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-01-16 18:31:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:48,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:48,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:48,319 INFO L426 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1166144013, now seen corresponding path program 89 times [2020-01-16 18:31:48,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:48,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974622190] [2020-01-16 18:31:48,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:48,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974622190] [2020-01-16 18:31:48,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:48,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:48,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153748765] [2020-01-16 18:31:48,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:48,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:48,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:48,713 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:31:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:48,868 INFO L93 Difference]: Finished difference Result 1378 states and 4854 transitions. [2020-01-16 18:31:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:48,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:48,872 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:31:48,872 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:31:48,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:31:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 791. [2020-01-16 18:31:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:31:48,894 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:48,895 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:31:48,895 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:31:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:48,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:48,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:48,896 INFO L426 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash 444796945, now seen corresponding path program 90 times [2020-01-16 18:31:48,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:48,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420902853] [2020-01-16 18:31:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420902853] [2020-01-16 18:31:49,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:49,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166418246] [2020-01-16 18:31:49,271 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:49,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:49,271 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,416 INFO L93 Difference]: Finished difference Result 1376 states and 4845 transitions. [2020-01-16 18:31:49,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:49,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,420 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:31:49,420 INFO L226 Difference]: Without dead ends: 1353 [2020-01-16 18:31:49,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-01-16 18:31:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 782. [2020-01-16 18:31:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:31:49,443 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:31:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:49,443 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:31:49,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:31:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:49,444 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:49,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:49,445 INFO L426 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1963730385, now seen corresponding path program 91 times [2020-01-16 18:31:49,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:49,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434715807] [2020-01-16 18:31:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434715807] [2020-01-16 18:31:49,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:49,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663331356] [2020-01-16 18:31:49,819 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:49,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:49,819 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:31:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,975 INFO L93 Difference]: Finished difference Result 1366 states and 4829 transitions. [2020-01-16 18:31:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:49,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,978 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:31:49,979 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:31:49,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:31:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-01-16 18:31:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:31:50,000 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:31:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:50,001 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:31:50,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:31:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:50,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:50,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:50,002 INFO L426 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -352789427, now seen corresponding path program 92 times [2020-01-16 18:31:50,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:50,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923012922] [2020-01-16 18:31:50,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:50,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-01-16 18:31:50,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923012922] [2020-01-16 18:31:50,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:50,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:50,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776943235] [2020-01-16 18:31:50,395 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:50,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:50,395 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:31:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:50,548 INFO L93 Difference]: Finished difference Result 1370 states and 4834 transitions. [2020-01-16 18:31:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:50,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:50,551 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:50,551 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:31:50,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:31:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 785. [2020-01-16 18:31:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:31:50,572 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:31:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:50,572 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:31:50,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:31:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:50,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:50,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:50,573 INFO L426 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 730799057, now seen corresponding path program 93 times [2020-01-16 18:31:50,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:50,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933593677] [2020-01-16 18:31:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:50,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933593677] [2020-01-16 18:31:50,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:50,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:50,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294228644] [2020-01-16 18:31:50,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:50,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:50,968 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:31:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:51,132 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-01-16 18:31:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:51,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:51,136 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:31:51,136 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:31:51,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:31:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:31:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:31:51,158 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:31:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:51,158 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:31:51,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:31:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:51,160 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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] [2020-01-16 18:31:51,160 INFO L426 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -342286323, now seen corresponding path program 94 times [2020-01-16 18:31:51,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:51,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301176943] [2020-01-16 18:31:51,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:51,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301176943] [2020-01-16 18:31:51,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:51,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:51,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288531761] [2020-01-16 18:31:51,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:51,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:51,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:51,532 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:31:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:51,674 INFO L93 Difference]: Finished difference Result 1366 states and 4823 transitions. [2020-01-16 18:31:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:51,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:51,678 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:31:51,678 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:31:51,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:31:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 785. [2020-01-16 18:31:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-01-16 18:31:51,700 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-01-16 18:31:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:51,700 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-01-16 18:31:51,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-01-16 18:31:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:51,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:51,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:51,702 INFO L426 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash 741302161, now seen corresponding path program 95 times [2020-01-16 18:31:51,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:51,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720728236] [2020-01-16 18:31:51,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:52,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720728236] [2020-01-16 18:31:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:52,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986836806] [2020-01-16 18:31:52,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:52,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:52,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:52,086 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:31:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,264 INFO L93 Difference]: Finished difference Result 1374 states and 4841 transitions. [2020-01-16 18:31:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:52,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,268 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:31:52,268 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:52,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-01-16 18:31:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-01-16 18:31:52,289 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,289 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-01-16 18:31:52,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-01-16 18:31:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:52,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:52,291 INFO L426 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1942724177, now seen corresponding path program 96 times [2020-01-16 18:31:52,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048176023] [2020-01-16 18:31:52,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:52,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048176023] [2020-01-16 18:31:52,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:52,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181690584] [2020-01-16 18:31:52,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:52,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:52,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:52,658 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,819 INFO L93 Difference]: Finished difference Result 1372 states and 4832 transitions. [2020-01-16 18:31:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:52,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,823 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:31:52,823 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:31:52,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:31:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2020-01-16 18:31:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:31:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3119 transitions. [2020-01-16 18:31:52,845 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3119 transitions. Word has length 25 [2020-01-16 18:31:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,845 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3119 transitions. [2020-01-16 18:31:52,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3119 transitions. [2020-01-16 18:31:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:52,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:52,846 INFO L426 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2073967317, now seen corresponding path program 97 times [2020-01-16 18:31:52,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364546613] [2020-01-16 18:31:52,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:53,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364546613] [2020-01-16 18:31:53,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:53,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:53,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194250881] [2020-01-16 18:31:53,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:53,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:53,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:53,226 INFO L87 Difference]: Start difference. First operand 779 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:31:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:53,385 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-01-16 18:31:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:53,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:53,388 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:31:53,388 INFO L226 Difference]: Without dead ends: 1361 [2020-01-16 18:31:53,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-01-16 18:31:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 788. [2020-01-16 18:31:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:31:53,410 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:31:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:53,410 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:31:53,410 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:31:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:53,411 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:53,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:53,411 INFO L426 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -610059021, now seen corresponding path program 98 times [2020-01-16 18:31:53,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:53,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028699365] [2020-01-16 18:31:53,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:53,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028699365] [2020-01-16 18:31:53,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:53,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:53,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430410031] [2020-01-16 18:31:53,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:53,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:53,806 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:31:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:53,941 INFO L93 Difference]: Finished difference Result 1373 states and 4852 transitions. [2020-01-16 18:31:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:53,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:53,945 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:31:53,945 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:53,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-01-16 18:31:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:31:53,967 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:31:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:53,967 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:31:53,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:31:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:53,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:53,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:53,968 INFO L426 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash 473529463, now seen corresponding path program 99 times [2020-01-16 18:31:53,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:53,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915306760] [2020-01-16 18:31:53,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:54,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915306760] [2020-01-16 18:31:54,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:54,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499518673] [2020-01-16 18:31:54,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:54,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:54,345 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:31:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:54,487 INFO L93 Difference]: Finished difference Result 1383 states and 4875 transitions. [2020-01-16 18:31:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:54,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:54,490 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:31:54,490 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:31:54,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:31:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 791. [2020-01-16 18:31:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:31:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-01-16 18:31:54,512 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-01-16 18:31:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:54,512 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-01-16 18:31:54,513 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-01-16 18:31:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:54,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:54,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:54,514 INFO L426 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -599555917, now seen corresponding path program 100 times [2020-01-16 18:31:54,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:54,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581301692] [2020-01-16 18:31:54,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:54,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581301692] [2020-01-16 18:31:54,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:54,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749430509] [2020-01-16 18:31:54,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:54,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:54,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:54,913 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:31:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:55,074 INFO L93 Difference]: Finished difference Result 1384 states and 4871 transitions. [2020-01-16 18:31:55,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:55,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:55,078 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:31:55,078 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:31:55,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:31:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 785. [2020-01-16 18:31:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:31:55,100 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:31:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:55,100 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:31:55,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:31:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:55,101 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:55,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:55,102 INFO L426 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 484032567, now seen corresponding path program 101 times [2020-01-16 18:31:55,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:55,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722812003] [2020-01-16 18:31:55,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:55,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722812003] [2020-01-16 18:31:55,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:55,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:55,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503530030] [2020-01-16 18:31:55,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:55,497 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:31:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:55,630 INFO L93 Difference]: Finished difference Result 1374 states and 4851 transitions. [2020-01-16 18:31:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:55,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:55,633 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:31:55,633 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:31:55,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:31:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 788. [2020-01-16 18:31:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:31:55,655 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:31:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:55,655 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:31:55,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:31:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:55,656 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:55,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:55,656 INFO L426 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2094973525, now seen corresponding path program 102 times [2020-01-16 18:31:55,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:55,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592035668] [2020-01-16 18:31:55,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:56,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592035668] [2020-01-16 18:31:56,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:56,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531516328] [2020-01-16 18:31:56,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:56,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:56,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:56,054 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:31:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,199 INFO L93 Difference]: Finished difference Result 1378 states and 4856 transitions. [2020-01-16 18:31:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:56,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,203 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:31:56,204 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:31:56,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:31:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 782. [2020-01-16 18:31:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-01-16 18:31:56,229 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-01-16 18:31:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,229 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-01-16 18:31:56,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-01-16 18:31:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:56,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:56,232 INFO L426 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash -294965901, now seen corresponding path program 103 times [2020-01-16 18:31:56,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147253161] [2020-01-16 18:31:56,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:56,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147253161] [2020-01-16 18:31:56,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:56,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663386145] [2020-01-16 18:31:56,611 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:56,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:56,612 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:31:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,765 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-01-16 18:31:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:56,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,770 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:31:56,770 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:31:56,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:31:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:31:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:31:56,792 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:31:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,792 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:31:56,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:31:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:56,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:56,793 INFO L426 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1315975057, now seen corresponding path program 104 times [2020-01-16 18:31:56,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870243800] [2020-01-16 18:31:56,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:57,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870243800] [2020-01-16 18:31:57,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:57,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105779457] [2020-01-16 18:31:57,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:57,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:57,180 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:31:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:57,325 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:31:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:57,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:57,329 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:31:57,329 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:31:57,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:31:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-01-16 18:31:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:31:57,350 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:31:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:57,350 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:31:57,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:31:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:57,352 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:57,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:57,352 INFO L426 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 799125687, now seen corresponding path program 105 times [2020-01-16 18:31:57,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:57,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597250924] [2020-01-16 18:31:57,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:57,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597250924] [2020-01-16 18:31:57,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:57,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612349171] [2020-01-16 18:31:57,754 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:57,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:57,755 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:31:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:57,897 INFO L93 Difference]: Finished difference Result 1377 states and 4858 transitions. [2020-01-16 18:31:57,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:57,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:57,901 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:31:57,901 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:31:57,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:31:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 790. [2020-01-16 18:31:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:31:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-01-16 18:31:57,927 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-01-16 18:31:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:57,928 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-01-16 18:31:57,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-01-16 18:31:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:57,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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] [2020-01-16 18:31:57,930 INFO L426 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1336981265, now seen corresponding path program 106 times [2020-01-16 18:31:57,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:57,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492084185] [2020-01-16 18:31:57,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:58,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492084185] [2020-01-16 18:31:58,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:58,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:58,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825667045] [2020-01-16 18:31:58,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:58,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:58,333 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:31:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:58,473 INFO L93 Difference]: Finished difference Result 1376 states and 4851 transitions. [2020-01-16 18:31:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:58,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:58,476 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:31:58,477 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:31:58,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:31:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-01-16 18:31:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:31:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:31:58,498 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:31:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:58,499 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:31:58,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:31:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:58,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:58,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:58,500 INFO L426 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash 809628791, now seen corresponding path program 107 times [2020-01-16 18:31:58,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:58,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579273871] [2020-01-16 18:31:58,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:58,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-01-16 18:31:58,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579273871] [2020-01-16 18:31:58,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:58,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:58,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45904945] [2020-01-16 18:31:58,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:58,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:58,903 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:31:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:59,049 INFO L93 Difference]: Finished difference Result 1369 states and 4837 transitions. [2020-01-16 18:31:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:59,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:59,053 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:31:59,053 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:31:59,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:31:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-01-16 18:31:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:31:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:31:59,075 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:31:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:59,075 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:31:59,075 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:31:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:59,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:59,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:59,076 INFO L426 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash -263456589, now seen corresponding path program 108 times [2020-01-16 18:31:59,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:59,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906856706] [2020-01-16 18:31:59,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:59,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906856706] [2020-01-16 18:31:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:31:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378406266] [2020-01-16 18:31:59,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:31:59,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:31:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:31:59,470 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:31:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:59,625 INFO L93 Difference]: Finished difference Result 1371 states and 4838 transitions. [2020-01-16 18:31:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:31:59,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:31:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:59,629 INFO L225 Difference]: With dead ends: 1371 [2020-01-16 18:31:59,629 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:31:59,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:31:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:31:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 782. [2020-01-16 18:31:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:31:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:31:59,652 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:31:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:59,652 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:31:59,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:31:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:31:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:31:59,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:59,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:59,653 INFO L426 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:31:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 30630323, now seen corresponding path program 109 times [2020-01-16 18:31:59,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:59,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84178637] [2020-01-16 18:31:59,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,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-01-16 18:32:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84178637] [2020-01-16 18:32:00,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:00,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366424181] [2020-01-16 18:32:00,075 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:00,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:00,075 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:32:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,238 INFO L93 Difference]: Finished difference Result 1391 states and 4896 transitions. [2020-01-16 18:32:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:00,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,242 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:32:00,242 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:32:00,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:32:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 793. [2020-01-16 18:32:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:32:00,265 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:32:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,265 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:32:00,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:32:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:00,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:00,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:00,266 INFO L426 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1042455057, now seen corresponding path program 110 times [2020-01-16 18:32:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392816010] [2020-01-16 18:32:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:00,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392816010] [2020-01-16 18:32:00,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:00,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244467550] [2020-01-16 18:32:00,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:00,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:00,664 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:32:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,812 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-01-16 18:32:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:00,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,815 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:32:00,815 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:32:00,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:32:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:32:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:32:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:32:00,836 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:32:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,836 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:32:00,836 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:32:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:00,837 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:00,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:00,837 INFO L426 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1569807531, now seen corresponding path program 111 times [2020-01-16 18:32:00,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842746878] [2020-01-16 18:32:00,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:01,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842746878] [2020-01-16 18:32:01,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:01,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268025870] [2020-01-16 18:32:01,228 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:01,229 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:32:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:01,375 INFO L93 Difference]: Finished difference Result 1388 states and 4884 transitions. [2020-01-16 18:32:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:01,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:01,379 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:32:01,379 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:32:01,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:32:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 792. [2020-01-16 18:32:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3150 transitions. [2020-01-16 18:32:01,401 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3150 transitions. Word has length 25 [2020-01-16 18:32:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:01,402 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3150 transitions. [2020-01-16 18:32:01,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3150 transitions. [2020-01-16 18:32:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:01,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:01,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:01,403 INFO L426 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1031951953, now seen corresponding path program 112 times [2020-01-16 18:32:01,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:01,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359833117] [2020-01-16 18:32:01,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,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-01-16 18:32:01,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359833117] [2020-01-16 18:32:01,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:01,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078994250] [2020-01-16 18:32:01,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:01,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:01,803 INFO L87 Difference]: Start difference. First operand 792 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:32:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:01,947 INFO L93 Difference]: Finished difference Result 1387 states and 4877 transitions. [2020-01-16 18:32:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:01,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:01,951 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:32:01,951 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:32:01,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:32:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:32:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:32:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-01-16 18:32:01,973 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-01-16 18:32:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:01,973 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-01-16 18:32:01,973 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-01-16 18:32:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:01,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:01,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:01,975 INFO L426 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1548801323, now seen corresponding path program 113 times [2020-01-16 18:32:01,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:01,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428434819] [2020-01-16 18:32:01,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:02,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428434819] [2020-01-16 18:32:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:02,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:02,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686613272] [2020-01-16 18:32:02,367 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:02,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:02,368 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:32:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:02,506 INFO L93 Difference]: Finished difference Result 1390 states and 4883 transitions. [2020-01-16 18:32:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:02,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:02,510 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:32:02,510 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:32:02,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:32:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-01-16 18:32:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:32:02,536 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:32:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:02,536 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:32:02,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:32:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:02,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:02,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:02,538 INFO L426 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash 62139635, now seen corresponding path program 114 times [2020-01-16 18:32:02,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:02,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470697419] [2020-01-16 18:32:02,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:02,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470697419] [2020-01-16 18:32:02,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:02,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:02,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173398456] [2020-01-16 18:32:02,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:02,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:02,935 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:32:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,094 INFO L93 Difference]: Finished difference Result 1388 states and 4874 transitions. [2020-01-16 18:32:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:03,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,098 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:32:03,098 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:32:03,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:32:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 782. [2020-01-16 18:32:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:32:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-01-16 18:32:03,120 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-01-16 18:32:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,120 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-01-16 18:32:03,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-01-16 18:32:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:03,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:03,121 INFO L426 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1967167505, now seen corresponding path program 115 times [2020-01-16 18:32:03,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790734620] [2020-01-16 18:32:03,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:03,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790734620] [2020-01-16 18:32:03,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:03,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:03,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656032680] [2020-01-16 18:32:03,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:03,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:03,512 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:32:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,650 INFO L93 Difference]: Finished difference Result 1372 states and 4843 transitions. [2020-01-16 18:32:03,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:03,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,654 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:32:03,654 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:32:03,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:32:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 788. [2020-01-16 18:32:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:32:03,689 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:32:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,689 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:32:03,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:32:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:03,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:03,691 INFO L426 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash -716858833, now seen corresponding path program 116 times [2020-01-16 18:32:03,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59825185] [2020-01-16 18:32:03,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,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-01-16 18:32:04,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59825185] [2020-01-16 18:32:04,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:04,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226787448] [2020-01-16 18:32:04,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:04,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:04,069 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:32:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:04,207 INFO L93 Difference]: Finished difference Result 1376 states and 4848 transitions. [2020-01-16 18:32:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:04,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:04,211 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:32:04,211 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:32:04,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:32:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-01-16 18:32:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:32:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-01-16 18:32:04,238 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-01-16 18:32:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:04,238 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-01-16 18:32:04,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-01-16 18:32:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:04,240 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:04,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:04,240 INFO L426 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 366729651, now seen corresponding path program 117 times [2020-01-16 18:32:04,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:04,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673335210] [2020-01-16 18:32:04,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:04,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673335210] [2020-01-16 18:32:04,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:04,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440150570] [2020-01-16 18:32:04,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:04,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:04,609 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:32:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:04,767 INFO L93 Difference]: Finished difference Result 1370 states and 4836 transitions. [2020-01-16 18:32:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:04,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:04,771 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:32:04,772 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:32:04,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:32:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:32:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-01-16 18:32:04,794 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-01-16 18:32:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:04,794 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-01-16 18:32:04,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-01-16 18:32:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:04,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:04,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] [2020-01-16 18:32:04,795 INFO L426 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash -706355729, now seen corresponding path program 118 times [2020-01-16 18:32:04,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:04,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158902981] [2020-01-16 18:32:04,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:05,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158902981] [2020-01-16 18:32:05,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:05,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:05,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470598124] [2020-01-16 18:32:05,166 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:05,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:05,166 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:32:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:05,327 INFO L93 Difference]: Finished difference Result 1372 states and 4837 transitions. [2020-01-16 18:32:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:05,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:05,331 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:32:05,331 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:32:05,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:32:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-01-16 18:32:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:32:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-01-16 18:32:05,355 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-01-16 18:32:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:05,356 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-01-16 18:32:05,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-01-16 18:32:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:05,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:05,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:05,357 INFO L426 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash 377232755, now seen corresponding path program 119 times [2020-01-16 18:32:05,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:05,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401593451] [2020-01-16 18:32:05,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:05,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401593451] [2020-01-16 18:32:05,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:05,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:05,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097922116] [2020-01-16 18:32:05,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:05,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:05,748 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:32:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:05,920 INFO L93 Difference]: Finished difference Result 1380 states and 4855 transitions. [2020-01-16 18:32:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:05,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:05,923 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:32:05,924 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:32:05,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:32:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-01-16 18:32:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3138 transitions. [2020-01-16 18:32:05,946 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3138 transitions. Word has length 25 [2020-01-16 18:32:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:05,946 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3138 transitions. [2020-01-16 18:32:05,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3138 transitions. [2020-01-16 18:32:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:05,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:05,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:05,947 INFO L426 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1988173713, now seen corresponding path program 120 times [2020-01-16 18:32:05,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:05,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029146088] [2020-01-16 18:32:05,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:06,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029146088] [2020-01-16 18:32:06,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:06,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:06,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21961932] [2020-01-16 18:32:06,331 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:06,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:06,331 INFO L87 Difference]: Start difference. First operand 790 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:32:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:06,472 INFO L93 Difference]: Finished difference Result 1378 states and 4846 transitions. [2020-01-16 18:32:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:06,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:06,476 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:32:06,476 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:32:06,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:32:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 776. [2020-01-16 18:32:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:32:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3111 transitions. [2020-01-16 18:32:06,499 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3111 transitions. Word has length 25 [2020-01-16 18:32:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:06,499 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3111 transitions. [2020-01-16 18:32:06,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3111 transitions. [2020-01-16 18:32:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:06,501 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:06,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:06,501 INFO L426 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1635199863, now seen corresponding path program 121 times [2020-01-16 18:32:06,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:06,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192614473] [2020-01-16 18:32:06,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:06,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192614473] [2020-01-16 18:32:06,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:06,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:06,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187163348] [2020-01-16 18:32:06,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:06,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:06,887 INFO L87 Difference]: Start difference. First operand 776 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:32:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,039 INFO L93 Difference]: Finished difference Result 1402 states and 4942 transitions. [2020-01-16 18:32:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:07,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,043 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:32:07,044 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:32:07,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:32:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 792. [2020-01-16 18:32:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3172 transitions. [2020-01-16 18:32:07,067 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3172 transitions. Word has length 25 [2020-01-16 18:32:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,067 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3172 transitions. [2020-01-16 18:32:07,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3172 transitions. [2020-01-16 18:32:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:07,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:07,069 INFO L426 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1689515819, now seen corresponding path program 122 times [2020-01-16 18:32:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034532556] [2020-01-16 18:32:07,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:07,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034532556] [2020-01-16 18:32:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:07,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:07,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727537702] [2020-01-16 18:32:07,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:07,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:07,454 INFO L87 Difference]: Start difference. First operand 792 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:32:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,621 INFO L93 Difference]: Finished difference Result 1404 states and 4942 transitions. [2020-01-16 18:32:07,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:07,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,625 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:32:07,625 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:32:07,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:32:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:32:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3162 transitions. [2020-01-16 18:32:07,647 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3162 transitions. Word has length 25 [2020-01-16 18:32:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,647 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3162 transitions. [2020-01-16 18:32:07,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3162 transitions. [2020-01-16 18:32:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:07,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:07,649 INFO L426 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash -733733355, now seen corresponding path program 123 times [2020-01-16 18:32:07,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367285676] [2020-01-16 18:32:07,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,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-01-16 18:32:08,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367285676] [2020-01-16 18:32:08,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:08,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702617404] [2020-01-16 18:32:08,040 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:08,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:08,041 INFO L87 Difference]: Start difference. First operand 788 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:32:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,205 INFO L93 Difference]: Finished difference Result 1398 states and 4930 transitions. [2020-01-16 18:32:08,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:08,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:08,209 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:32:08,209 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:32:08,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:32:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 791. [2020-01-16 18:32:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3167 transitions. [2020-01-16 18:32:08,232 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3167 transitions. Word has length 25 [2020-01-16 18:32:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:08,232 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3167 transitions. [2020-01-16 18:32:08,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3167 transitions. [2020-01-16 18:32:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:08,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:08,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:08,233 INFO L426 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:08,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 247021363, now seen corresponding path program 124 times [2020-01-16 18:32:08,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:08,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257305662] [2020-01-16 18:32:08,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,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-01-16 18:32:08,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257305662] [2020-01-16 18:32:08,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:08,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356718966] [2020-01-16 18:32:08,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:08,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:08,614 INFO L87 Difference]: Start difference. First operand 791 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:32:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,784 INFO L93 Difference]: Finished difference Result 1397 states and 4925 transitions. [2020-01-16 18:32:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:08,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:08,788 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:32:08,788 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:32:08,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:32:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-01-16 18:32:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3159 transitions. [2020-01-16 18:32:08,810 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3159 transitions. Word has length 25 [2020-01-16 18:32:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:08,810 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3159 transitions. [2020-01-16 18:32:08,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3159 transitions. [2020-01-16 18:32:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:08,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:08,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:08,811 INFO L426 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1350890633, now seen corresponding path program 125 times [2020-01-16 18:32:08,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:08,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198697301] [2020-01-16 18:32:08,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:09,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198697301] [2020-01-16 18:32:09,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:09,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:09,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983768034] [2020-01-16 18:32:09,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:09,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:09,185 INFO L87 Difference]: Start difference. First operand 788 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:32:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:09,334 INFO L93 Difference]: Finished difference Result 1402 states and 4935 transitions. [2020-01-16 18:32:09,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:09,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:09,339 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:32:09,339 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:32:09,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:32:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 791. [2020-01-16 18:32:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-01-16 18:32:09,362 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-01-16 18:32:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:09,362 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-01-16 18:32:09,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-01-16 18:32:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:09,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:09,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:09,364 INFO L426 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash 260050325, now seen corresponding path program 126 times [2020-01-16 18:32:09,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:09,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47968851] [2020-01-16 18:32:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:09,739 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-01-16 18:32:09,877 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:32:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:09,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47968851] [2020-01-16 18:32:09,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:09,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:09,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975046914] [2020-01-16 18:32:09,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:09,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:09,889 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:32:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:10,086 INFO L93 Difference]: Finished difference Result 1399 states and 4926 transitions. [2020-01-16 18:32:10,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:10,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:10,092 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:32:10,092 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:32:10,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:32:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 785. [2020-01-16 18:32:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:32:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3151 transitions. [2020-01-16 18:32:10,145 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3151 transitions. Word has length 25 [2020-01-16 18:32:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:10,146 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3151 transitions. [2020-01-16 18:32:10,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3151 transitions. [2020-01-16 18:32:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:10,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:10,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:10,149 INFO L426 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1212714137, now seen corresponding path program 127 times [2020-01-16 18:32:10,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:10,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562219849] [2020-01-16 18:32:10,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:10,596 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:32:10,728 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:32:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:10,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562219849] [2020-01-16 18:32:10,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:10,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:10,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082117122] [2020-01-16 18:32:10,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:10,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:10,740 INFO L87 Difference]: Start difference. First operand 785 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:32:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:10,993 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-01-16 18:32:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:10,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:10,997 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:32:10,997 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:10,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:32:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-01-16 18:32:11,050 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-01-16 18:32:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:11,050 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-01-16 18:32:11,050 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-01-16 18:32:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:11,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:11,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:11,054 INFO L426 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2112001545, now seen corresponding path program 128 times [2020-01-16 18:32:11,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:11,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095541900] [2020-01-16 18:32:11,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:11,508 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:32:11,642 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:32:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:11,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095541900] [2020-01-16 18:32:11,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:11,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:11,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9579176] [2020-01-16 18:32:11,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:11,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:11,648 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:32:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:11,800 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-01-16 18:32:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:11,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:11,804 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:32:11,804 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:32:11,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:32:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:32:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3162 transitions. [2020-01-16 18:32:11,838 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3162 transitions. Word has length 25 [2020-01-16 18:32:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:11,839 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3162 transitions. [2020-01-16 18:32:11,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3162 transitions. [2020-01-16 18:32:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:11,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:11,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:11,842 INFO L426 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 769814997, now seen corresponding path program 129 times [2020-01-16 18:32:11,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:11,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534606519] [2020-01-16 18:32:11,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:12,334 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:32:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:12,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534606519] [2020-01-16 18:32:12,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:12,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:12,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074179682] [2020-01-16 18:32:12,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:12,340 INFO L87 Difference]: Start difference. First operand 789 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:32:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:12,477 INFO L93 Difference]: Finished difference Result 1412 states and 4961 transitions. [2020-01-16 18:32:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:12,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:12,481 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:32:12,481 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:32:12,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:32:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 793. [2020-01-16 18:32:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-01-16 18:32:12,503 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-01-16 18:32:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:12,503 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-01-16 18:32:12,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-01-16 18:32:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:12,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:12,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:12,504 INFO L426 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1761072819, now seen corresponding path program 130 times [2020-01-16 18:32:12,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:12,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594636895] [2020-01-16 18:32:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:12,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594636895] [2020-01-16 18:32:12,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:12,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:12,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490641668] [2020-01-16 18:32:12,894 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:12,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:12,894 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:32:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:13,086 INFO L93 Difference]: Finished difference Result 1415 states and 4963 transitions. [2020-01-16 18:32:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:13,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:13,089 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:32:13,089 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:32:13,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:32:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 789. [2020-01-16 18:32:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3158 transitions. [2020-01-16 18:32:13,111 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3158 transitions. Word has length 25 [2020-01-16 18:32:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:13,111 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3158 transitions. [2020-01-16 18:32:13,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3158 transitions. [2020-01-16 18:32:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:13,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:13,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:13,112 INFO L426 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:13,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1447780135, now seen corresponding path program 131 times [2020-01-16 18:32:13,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:13,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119283271] [2020-01-16 18:32:13,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:13,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119283271] [2020-01-16 18:32:13,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:13,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:13,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141166245] [2020-01-16 18:32:13,489 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:13,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:13,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:13,490 INFO L87 Difference]: Start difference. First operand 789 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:32:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:13,633 INFO L93 Difference]: Finished difference Result 1418 states and 4971 transitions. [2020-01-16 18:32:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:13,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:13,637 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:32:13,637 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:32:13,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:32:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2020-01-16 18:32:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3169 transitions. [2020-01-16 18:32:13,663 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3169 transitions. Word has length 25 [2020-01-16 18:32:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:13,663 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3169 transitions. [2020-01-16 18:32:13,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3169 transitions. [2020-01-16 18:32:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:13,665 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:13,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:13,665 INFO L426 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1774101781, now seen corresponding path program 132 times [2020-01-16 18:32:13,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:13,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609839035] [2020-01-16 18:32:13,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:14,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609839035] [2020-01-16 18:32:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965278575] [2020-01-16 18:32:14,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:14,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:14,070 INFO L87 Difference]: Start difference. First operand 795 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:32:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,255 INFO L93 Difference]: Finished difference Result 1419 states and 4967 transitions. [2020-01-16 18:32:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:14,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,259 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:32:14,259 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:32:14,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:32:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 785. [2020-01-16 18:32:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:32:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3148 transitions. [2020-01-16 18:32:14,281 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3148 transitions. Word has length 25 [2020-01-16 18:32:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,281 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3148 transitions. [2020-01-16 18:32:14,281 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3148 transitions. [2020-01-16 18:32:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:14,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:14,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:14,283 INFO L426 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1578704807, now seen corresponding path program 133 times [2020-01-16 18:32:14,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862855087] [2020-01-16 18:32:14,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:14,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-01-16 18:32:14,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862855087] [2020-01-16 18:32:14,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:14,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:14,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428095825] [2020-01-16 18:32:14,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:14,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:14,679 INFO L87 Difference]: Start difference. First operand 785 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:32:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,862 INFO L93 Difference]: Finished difference Result 1399 states and 4929 transitions. [2020-01-16 18:32:14,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:14,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,866 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:32:14,867 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:32:14,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:32:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 791. [2020-01-16 18:32:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-01-16 18:32:14,889 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-01-16 18:32:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,890 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-01-16 18:32:14,890 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-01-16 18:32:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:14,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32: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] [2020-01-16 18:32:14,891 INFO L426 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:14,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash -597950089, now seen corresponding path program 134 times [2020-01-16 18:32:14,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150192208] [2020-01-16 18:32:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:15,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150192208] [2020-01-16 18:32:15,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:15,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038807562] [2020-01-16 18:32:15,282 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:15,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:15,283 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:32:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:15,464 INFO L93 Difference]: Finished difference Result 1398 states and 4924 transitions. [2020-01-16 18:32:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:15,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:15,468 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:32:15,468 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:32:15,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:32:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:32:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3156 transitions. [2020-01-16 18:32:15,491 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3156 transitions. Word has length 25 [2020-01-16 18:32:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:15,491 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3156 transitions. [2020-01-16 18:32:15,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3156 transitions. [2020-01-16 18:32:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:15,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:15,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:15,492 INFO L426 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 347329271, now seen corresponding path program 135 times [2020-01-16 18:32:15,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:15,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419265914] [2020-01-16 18:32:15,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:15,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419265914] [2020-01-16 18:32:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:15,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627850669] [2020-01-16 18:32:15,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:15,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:15,973 INFO L87 Difference]: Start difference. First operand 788 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:32:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:16,123 INFO L93 Difference]: Finished difference Result 1404 states and 4937 transitions. [2020-01-16 18:32:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:16,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,128 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:32:16,129 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:32:16,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:32:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 792. [2020-01-16 18:32:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3163 transitions. [2020-01-16 18:32:16,175 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3163 transitions. Word has length 25 [2020-01-16 18:32:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,176 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3163 transitions. [2020-01-16 18:32:16,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3163 transitions. [2020-01-16 18:32:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:16,179 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:16,179 INFO L426 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1338587093, now seen corresponding path program 136 times [2020-01-16 18:32:16,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040142359] [2020-01-16 18:32:16,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:16,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040142359] [2020-01-16 18:32:16,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:16,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:16,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229837959] [2020-01-16 18:32:16,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:16,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:16,649 INFO L87 Difference]: Start difference. First operand 792 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:32:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:16,829 INFO L93 Difference]: Finished difference Result 1407 states and 4939 transitions. [2020-01-16 18:32:16,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:16,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,833 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:32:16,834 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:32:16,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:32:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 788. [2020-01-16 18:32:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-01-16 18:32:16,855 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-01-16 18:32:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,855 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-01-16 18:32:16,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-01-16 18:32:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:16,856 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:16,857 INFO L426 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 66271321, now seen corresponding path program 137 times [2020-01-16 18:32:16,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944421934] [2020-01-16 18:32:16,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:17,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944421934] [2020-01-16 18:32:17,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:17,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073145942] [2020-01-16 18:32:17,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:17,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:17,254 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:32:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:17,439 INFO L93 Difference]: Finished difference Result 1401 states and 4927 transitions. [2020-01-16 18:32:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:17,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:17,443 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:32:17,444 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:32:17,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:32:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-01-16 18:32:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:32:17,466 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:32:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:17,466 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:32:17,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:32:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:17,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:17,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:17,468 INFO L426 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1677212279, now seen corresponding path program 138 times [2020-01-16 18:32:17,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:17,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284652158] [2020-01-16 18:32:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:17,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284652158] [2020-01-16 18:32:17,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:17,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392471781] [2020-01-16 18:32:17,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:17,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:17,864 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:32:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,017 INFO L93 Difference]: Finished difference Result 1405 states and 4932 transitions. [2020-01-16 18:32:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:18,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,021 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:32:18,021 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:32:18,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:32:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 785. [2020-01-16 18:32:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:32:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3145 transitions. [2020-01-16 18:32:18,042 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3145 transitions. Word has length 25 [2020-01-16 18:32:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,042 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3145 transitions. [2020-01-16 18:32:18,042 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3145 transitions. [2020-01-16 18:32:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:18,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:18,044 INFO L426 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2060103893, now seen corresponding path program 139 times [2020-01-16 18:32:18,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746261878] [2020-01-16 18:32:18,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:18,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746261878] [2020-01-16 18:32:18,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:18,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:18,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666861669] [2020-01-16 18:32:18,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:18,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:18,457 INFO L87 Difference]: Start difference. First operand 785 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:32:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,637 INFO L93 Difference]: Finished difference Result 1407 states and 4944 transitions. [2020-01-16 18:32:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:18,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,642 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:32:18,642 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:32:18,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:32:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-01-16 18:32:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-01-16 18:32:18,664 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-01-16 18:32:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,664 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-01-16 18:32:18,664 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-01-16 18:32:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:18,665 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:18,665 INFO L426 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,666 INFO L82 PathProgramCache]: Analyzing trace with hash -623922445, now seen corresponding path program 140 times [2020-01-16 18:32:18,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072315436] [2020-01-16 18:32:18,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:19,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072315436] [2020-01-16 18:32:19,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:19,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:19,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551986902] [2020-01-16 18:32:19,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:19,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:19,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:19,053 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:32:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:19,220 INFO L93 Difference]: Finished difference Result 1404 states and 4935 transitions. [2020-01-16 18:32:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:19,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:19,224 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:32:19,224 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:32:19,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:32:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-01-16 18:32:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-01-16 18:32:19,246 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-01-16 18:32:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:19,246 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-01-16 18:32:19,246 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-01-16 18:32:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:19,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:19,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:19,247 INFO L426 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:19,248 INFO L82 PathProgramCache]: Analyzing trace with hash 459666039, now seen corresponding path program 141 times [2020-01-16 18:32:19,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:19,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000517567] [2020-01-16 18:32:19,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:19,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-01-16 18:32:19,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000517567] [2020-01-16 18:32:19,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:19,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:19,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992668430] [2020-01-16 18:32:19,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:19,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:19,638 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:32:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:19,808 INFO L93 Difference]: Finished difference Result 1414 states and 4958 transitions. [2020-01-16 18:32:19,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:19,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:19,813 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:32:19,813 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:32:19,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:32:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-01-16 18:32:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:32:19,834 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:32:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:19,835 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:32:19,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:32:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:19,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:19,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:19,836 INFO L426 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -613419341, now seen corresponding path program 142 times [2020-01-16 18:32:19,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:19,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217722745] [2020-01-16 18:32:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:20,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217722745] [2020-01-16 18:32:20,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:20,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027383293] [2020-01-16 18:32:20,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:20,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:20,241 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:32:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:20,426 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-01-16 18:32:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:20,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:20,430 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:32:20,430 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:32:20,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:32:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 788. [2020-01-16 18:32:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:32:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3150 transitions. [2020-01-16 18:32:20,452 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3150 transitions. Word has length 25 [2020-01-16 18:32:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:20,452 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3150 transitions. [2020-01-16 18:32:20,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3150 transitions. [2020-01-16 18:32:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:20,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:20,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:20,453 INFO L426 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash 470169143, now seen corresponding path program 143 times [2020-01-16 18:32:20,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:20,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145730467] [2020-01-16 18:32:20,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:20,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145730467] [2020-01-16 18:32:20,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:20,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627977273] [2020-01-16 18:32:20,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:20,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:20,862 INFO L87 Difference]: Start difference. First operand 788 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:32:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:21,044 INFO L93 Difference]: Finished difference Result 1405 states and 4934 transitions. [2020-01-16 18:32:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:21,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:21,048 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:32:21,049 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:32:21,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:32:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 791. [2020-01-16 18:32:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:32:21,073 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:32:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:21,073 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:32:21,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:32:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:21,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:21,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:21,075 INFO L426 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2081110101, now seen corresponding path program 144 times [2020-01-16 18:32:21,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:21,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316350190] [2020-01-16 18:32:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:21,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316350190] [2020-01-16 18:32:21,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:21,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:21,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737662822] [2020-01-16 18:32:21,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:21,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:21,456 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:32:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:21,644 INFO L93 Difference]: Finished difference Result 1409 states and 4939 transitions. [2020-01-16 18:32:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:21,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:21,648 INFO L225 Difference]: With dead ends: 1409 [2020-01-16 18:32:21,649 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:32:21,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:32:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 782. [2020-01-16 18:32:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:32:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3137 transitions. [2020-01-16 18:32:21,674 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3137 transitions. Word has length 25 [2020-01-16 18:32:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:21,674 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3137 transitions. [2020-01-16 18:32:21,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3137 transitions. [2020-01-16 18:32:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:21,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:21,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:21,675 INFO L426 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1210888627, now seen corresponding path program 145 times [2020-01-16 18:32:21,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:21,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523445456] [2020-01-16 18:32:21,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:22,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523445456] [2020-01-16 18:32:22,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:22,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:22,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086508264] [2020-01-16 18:32:22,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:22,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:22,060 INFO L87 Difference]: Start difference. First operand 782 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:32:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,260 INFO L93 Difference]: Finished difference Result 1411 states and 4961 transitions. [2020-01-16 18:32:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:22,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,264 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:32:22,264 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:22,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:32:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-01-16 18:32:22,289 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-01-16 18:32:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,289 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-01-16 18:32:22,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-01-16 18:32:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:22,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:22,290 INFO L426 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2113827055, now seen corresponding path program 146 times [2020-01-16 18:32:22,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85779511] [2020-01-16 18:32:22,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:22,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85779511] [2020-01-16 18:32:22,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:22,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:22,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700543079] [2020-01-16 18:32:22,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:22,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:22,669 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:32:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,859 INFO L93 Difference]: Finished difference Result 1413 states and 4961 transitions. [2020-01-16 18:32:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:22,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,863 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:32:22,863 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:32:22,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:32:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:32:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-01-16 18:32:22,885 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-01-16 18:32:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,885 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-01-16 18:32:22,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-01-16 18:32:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:22,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:22,886 INFO L426 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1158044591, now seen corresponding path program 147 times [2020-01-16 18:32:22,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207740882] [2020-01-16 18:32:22,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207740882] [2020-01-16 18:32:23,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:23,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099900352] [2020-01-16 18:32:23,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:23,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:23,270 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:32:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:23,419 INFO L93 Difference]: Finished difference Result 1407 states and 4949 transitions. [2020-01-16 18:32:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:23,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:23,423 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:32:23,423 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:32:23,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:32:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-01-16 18:32:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3168 transitions. [2020-01-16 18:32:23,444 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:23,444 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3168 transitions. [2020-01-16 18:32:23,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3168 transitions. [2020-01-16 18:32:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:23,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:23,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:23,445 INFO L426 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -177289873, now seen corresponding path program 148 times [2020-01-16 18:32:23,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:23,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623437814] [2020-01-16 18:32:23,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623437814] [2020-01-16 18:32:23,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:23,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038261276] [2020-01-16 18:32:23,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:23,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:23,913 INFO L87 Difference]: Start difference. First operand 792 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,094 INFO L93 Difference]: Finished difference Result 1406 states and 4944 transitions. [2020-01-16 18:32:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:24,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,098 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:32:24,098 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:32:24,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:32:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 789. [2020-01-16 18:32:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-01-16 18:32:24,119 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-01-16 18:32:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,120 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-01-16 18:32:24,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-01-16 18:32:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:24,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:24,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:24,121 INFO L426 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1775201869, now seen corresponding path program 149 times [2020-01-16 18:32:24,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558207500] [2020-01-16 18:32:24,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:24,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-01-16 18:32:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558207500] [2020-01-16 18:32:24,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:24,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:24,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267208405] [2020-01-16 18:32:24,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:24,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:24,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:24,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:24,508 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:32:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,655 INFO L93 Difference]: Finished difference Result 1411 states and 4954 transitions. [2020-01-16 18:32:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:24,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,659 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:32:24,659 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:32:24,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:32:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:32:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3165 transitions. [2020-01-16 18:32:24,680 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3165 transitions. Word has length 25 [2020-01-16 18:32:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,680 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3165 transitions. [2020-01-16 18:32:24,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3165 transitions. [2020-01-16 18:32:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:24,682 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:24,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:24,682 INFO L426 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash -164260911, now seen corresponding path program 150 times [2020-01-16 18:32:24,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534950109] [2020-01-16 18:32:24,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534950109] [2020-01-16 18:32:25,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:25,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773448247] [2020-01-16 18:32:25,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:25,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:25,066 INFO L87 Difference]: Start difference. First operand 792 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:32:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:25,235 INFO L93 Difference]: Finished difference Result 1408 states and 4945 transitions. [2020-01-16 18:32:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:25,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:25,239 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:32:25,239 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:32:25,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:32:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-01-16 18:32:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:32:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3152 transitions. [2020-01-16 18:32:25,261 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3152 transitions. Word has length 25 [2020-01-16 18:32:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:25,261 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3152 transitions. [2020-01-16 18:32:25,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3152 transitions. [2020-01-16 18:32:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:25,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:25,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:25,263 INFO L426 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash -56568551, now seen corresponding path program 151 times [2020-01-16 18:32:25,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:25,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039070642] [2020-01-16 18:32:25,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039070642] [2020-01-16 18:32:25,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:25,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742382217] [2020-01-16 18:32:25,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:25,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:25,658 INFO L87 Difference]: Start difference. First operand 786 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:32:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:25,823 INFO L93 Difference]: Finished difference Result 1425 states and 4992 transitions. [2020-01-16 18:32:25,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:25,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:25,827 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:32:25,827 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:32:25,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:32:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:32:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3177 transitions. [2020-01-16 18:32:25,849 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3177 transitions. Word has length 25 [2020-01-16 18:32:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:25,849 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3177 transitions. [2020-01-16 18:32:25,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3177 transitions. [2020-01-16 18:32:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:25,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:25,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:25,851 INFO L426 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash 913683063, now seen corresponding path program 152 times [2020-01-16 18:32:25,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:25,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740302801] [2020-01-16 18:32:25,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:26,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740302801] [2020-01-16 18:32:26,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:26,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:26,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699257804] [2020-01-16 18:32:26,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:26,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:26,227 INFO L87 Difference]: Start difference. First operand 795 states and 3177 transitions. Second operand 10 states. [2020-01-16 18:32:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,361 INFO L93 Difference]: Finished difference Result 1427 states and 4992 transitions. [2020-01-16 18:32:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:26,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,365 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:32:26,365 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:32:26,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:32:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-01-16 18:32:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-01-16 18:32:26,388 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-01-16 18:32:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,388 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-01-16 18:32:26,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-01-16 18:32:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:26,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:26,389 INFO L426 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -942366831, now seen corresponding path program 153 times [2020-01-16 18:32:26,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357182072] [2020-01-16 18:32:26,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:26,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-01-16 18:32:26,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357182072] [2020-01-16 18:32:26,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:26,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:26,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38337372] [2020-01-16 18:32:26,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:26,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:26,779 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:32:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,938 INFO L93 Difference]: Finished difference Result 1429 states and 4995 transitions. [2020-01-16 18:32:26,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:26,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,942 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:32:26,942 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:32:26,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:32:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 796. [2020-01-16 18:32:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:32:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3175 transitions. [2020-01-16 18:32:26,964 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3175 transitions. Word has length 25 [2020-01-16 18:32:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,964 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3175 transitions. [2020-01-16 18:32:26,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3175 transitions. [2020-01-16 18:32:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:26,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:26,966 INFO L426 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash 69897199, now seen corresponding path program 154 times [2020-01-16 18:32:26,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579647860] [2020-01-16 18:32:26,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,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-01-16 18:32:27,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579647860] [2020-01-16 18:32:27,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:27,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355805783] [2020-01-16 18:32:27,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:27,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:27,389 INFO L87 Difference]: Start difference. First operand 796 states and 3175 transitions. Second operand 10 states. [2020-01-16 18:32:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:27,505 INFO L93 Difference]: Finished difference Result 1434 states and 5000 transitions. [2020-01-16 18:32:27,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:27,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:27,509 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:32:27,510 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:32:27,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:32:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-01-16 18:32:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-01-16 18:32:27,532 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-01-16 18:32:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:27,533 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-01-16 18:32:27,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-01-16 18:32:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:27,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:27,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:27,534 INFO L426 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2065870375, now seen corresponding path program 155 times [2020-01-16 18:32:27,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:27,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372825134] [2020-01-16 18:32:27,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,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-01-16 18:32:27,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372825134] [2020-01-16 18:32:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709088238] [2020-01-16 18:32:27,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:27,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:27,939 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:32:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,073 INFO L93 Difference]: Finished difference Result 1435 states and 5004 transitions. [2020-01-16 18:32:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:28,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,076 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:32:28,077 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:32:28,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:32:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 798. [2020-01-16 18:32:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:32:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3174 transitions. [2020-01-16 18:32:28,098 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3174 transitions. Word has length 25 [2020-01-16 18:32:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,098 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3174 transitions. [2020-01-16 18:32:28,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3174 transitions. [2020-01-16 18:32:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:28,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:28,099 INFO L426 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash 82926161, now seen corresponding path program 156 times [2020-01-16 18:32:28,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813280556] [2020-01-16 18:32:28,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:28,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-01-16 18:32:28,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813280556] [2020-01-16 18:32:28,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:28,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:28,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306508363] [2020-01-16 18:32:28,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:28,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:28,507 INFO L87 Difference]: Start difference. First operand 798 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:32:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,640 INFO L93 Difference]: Finished difference Result 1438 states and 5003 transitions. [2020-01-16 18:32:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:28,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,644 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:32:28,644 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:32:28,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:32:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 786. [2020-01-16 18:32:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:32:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3148 transitions. [2020-01-16 18:32:28,666 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3148 transitions. Word has length 25 [2020-01-16 18:32:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,666 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3148 transitions. [2020-01-16 18:32:28,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3148 transitions. [2020-01-16 18:32:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:28,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,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] [2020-01-16 18:32:28,668 INFO L426 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1446979801, now seen corresponding path program 157 times [2020-01-16 18:32:28,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746837257] [2020-01-16 18:32:28,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746837257] [2020-01-16 18:32:29,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:29,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812745897] [2020-01-16 18:32:29,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:29,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:29,067 INFO L87 Difference]: Start difference. First operand 786 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:32:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:29,198 INFO L93 Difference]: Finished difference Result 1413 states and 4957 transitions. [2020-01-16 18:32:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:29,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:29,202 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:32:29,202 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:32:29,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:32:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 793. [2020-01-16 18:32:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3167 transitions. [2020-01-16 18:32:29,224 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3167 transitions. Word has length 25 [2020-01-16 18:32:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:29,225 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3167 transitions. [2020-01-16 18:32:29,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3167 transitions. [2020-01-16 18:32:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:29,226 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:29,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:29,226 INFO L426 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1867232777, now seen corresponding path program 158 times [2020-01-16 18:32:29,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:29,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558605902] [2020-01-16 18:32:29,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558605902] [2020-01-16 18:32:29,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075458318] [2020-01-16 18:32:29,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:29,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:29,629 INFO L87 Difference]: Start difference. First operand 793 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:32:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:29,778 INFO L93 Difference]: Finished difference Result 1412 states and 4952 transitions. [2020-01-16 18:32:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:29,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:29,782 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:32:29,783 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:32:29,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:32:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 790. [2020-01-16 18:32:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-01-16 18:32:29,805 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-01-16 18:32:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:29,805 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-01-16 18:32:29,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-01-16 18:32:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:29,807 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:29,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:29,807 INFO L426 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1364852557, now seen corresponding path program 159 times [2020-01-16 18:32:29,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:29,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169252757] [2020-01-16 18:32:29,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:30,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169252757] [2020-01-16 18:32:30,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:30,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:30,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735812130] [2020-01-16 18:32:30,196 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:30,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:30,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:30,196 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:32:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,327 INFO L93 Difference]: Finished difference Result 1421 states and 4970 transitions. [2020-01-16 18:32:30,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:30,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,331 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:32:30,331 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:32:30,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:32:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-01-16 18:32:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-01-16 18:32:30,353 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,354 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-01-16 18:32:30,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-01-16 18:32:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:30,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,355 INFO L426 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash -352588527, now seen corresponding path program 160 times [2020-01-16 18:32:30,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459784048] [2020-01-16 18:32:30,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:30,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459784048] [2020-01-16 18:32:30,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:30,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:30,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285233479] [2020-01-16 18:32:30,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:30,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:30,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:30,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:30,752 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,855 INFO L93 Difference]: Finished difference Result 1426 states and 4975 transitions. [2020-01-16 18:32:30,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:30,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,859 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:32:30,859 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:32:30,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:32:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:32:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:32:30,881 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:32:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,882 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:32:30,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:32:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:30,883 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,883 INFO L426 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -551818919, now seen corresponding path program 161 times [2020-01-16 18:32:30,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917122610] [2020-01-16 18:32:30,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:31,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917122610] [2020-01-16 18:32:31,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:31,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158807815] [2020-01-16 18:32:31,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:31,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:31,270 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:32:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,401 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-01-16 18:32:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:31,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,405 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:32:31,405 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:32:31,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:32:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:32:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:32:31,427 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:32:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,428 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:32:31,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:32:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:31,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:31,429 INFO L426 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -13963341, now seen corresponding path program 162 times [2020-01-16 18:32:31,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741086229] [2020-01-16 18:32:31,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741086229] [2020-01-16 18:32:31,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:31,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402569568] [2020-01-16 18:32:31,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:31,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:31,827 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:32:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,962 INFO L93 Difference]: Finished difference Result 1424 states and 4967 transitions. [2020-01-16 18:32:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:31,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,966 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:32:31,966 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:31,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-01-16 18:32:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:32:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3144 transitions. [2020-01-16 18:32:31,988 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3144 transitions. Word has length 25 [2020-01-16 18:32:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,989 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3144 transitions. [2020-01-16 18:32:31,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3144 transitions. [2020-01-16 18:32:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:31,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:31,990 INFO L426 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 347922065, now seen corresponding path program 163 times [2020-01-16 18:32:31,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240076137] [2020-01-16 18:32:31,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:32,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-01-16 18:32:32,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240076137] [2020-01-16 18:32:32,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:32,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:32,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763933906] [2020-01-16 18:32:32,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:32,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:32,379 INFO L87 Difference]: Start difference. First operand 786 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:32:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:32,537 INFO L93 Difference]: Finished difference Result 1421 states and 4971 transitions. [2020-01-16 18:32:32,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:32,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:32,541 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:32:32,541 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:32:32,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:32:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 793. [2020-01-16 18:32:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3163 transitions. [2020-01-16 18:32:32,563 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3163 transitions. Word has length 25 [2020-01-16 18:32:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:32,563 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3163 transitions. [2020-01-16 18:32:32,563 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3163 transitions. [2020-01-16 18:32:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:32,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:32,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:32,564 INFO L426 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1958863023, now seen corresponding path program 164 times [2020-01-16 18:32:32,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:32,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035509145] [2020-01-16 18:32:32,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:32,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035509145] [2020-01-16 18:32:32,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:32,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:32,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320049203] [2020-01-16 18:32:32,955 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:32,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:32,955 INFO L87 Difference]: Start difference. First operand 793 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:32:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,087 INFO L93 Difference]: Finished difference Result 1418 states and 4962 transitions. [2020-01-16 18:32:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:33,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,091 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:32:33,091 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:32:33,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:32:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:32:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:32:33,114 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:32:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,114 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:32:33,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:32:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:33,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:33,115 INFO L426 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash -158424201, now seen corresponding path program 165 times [2020-01-16 18:32:33,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728068470] [2020-01-16 18:32:33,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:33,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728068470] [2020-01-16 18:32:33,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:33,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:33,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561042059] [2020-01-16 18:32:33,510 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:33,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:33,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:33,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:33,510 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:32:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,638 INFO L93 Difference]: Finished difference Result 1431 states and 4990 transitions. [2020-01-16 18:32:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:33,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,642 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:32:33,642 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:32:33,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:32:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-01-16 18:32:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:32:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:32:33,665 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,665 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:32:33,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:32:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:33,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:33,666 INFO L426 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1990372335, now seen corresponding path program 166 times [2020-01-16 18:32:33,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808751566] [2020-01-16 18:32:33,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808751566] [2020-01-16 18:32:34,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:34,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383227222] [2020-01-16 18:32:34,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:34,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:34,081 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:34,185 INFO L93 Difference]: Finished difference Result 1434 states and 4989 transitions. [2020-01-16 18:32:34,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:34,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:34,189 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:32:34,189 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:32:34,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:32:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-01-16 18:32:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3151 transitions. [2020-01-16 18:32:34,212 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3151 transitions. Word has length 25 [2020-01-16 18:32:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:34,212 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3151 transitions. [2020-01-16 18:32:34,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3151 transitions. [2020-01-16 18:32:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:34,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:34,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:34,213 INFO L426 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash -147921097, now seen corresponding path program 167 times [2020-01-16 18:32:34,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:34,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087371595] [2020-01-16 18:32:34,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087371595] [2020-01-16 18:32:34,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:34,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196550923] [2020-01-16 18:32:34,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:34,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:34,616 INFO L87 Difference]: Start difference. First operand 790 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:32:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:34,749 INFO L93 Difference]: Finished difference Result 1422 states and 4965 transitions. [2020-01-16 18:32:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:34,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:34,753 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:32:34,753 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:32:34,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:32:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-01-16 18:32:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-01-16 18:32:34,776 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-01-16 18:32:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:34,776 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-01-16 18:32:34,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-01-16 18:32:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:34,777 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:34,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:34,777 INFO L426 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 389934481, now seen corresponding path program 168 times [2020-01-16 18:32:34,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:34,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453293537] [2020-01-16 18:32:34,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:35,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453293537] [2020-01-16 18:32:35,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:35,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:35,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952508601] [2020-01-16 18:32:35,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:35,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:35,173 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:32:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,281 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:32:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:35,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,284 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:32:35,284 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:35,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 782. [2020-01-16 18:32:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:32:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:32:35,307 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:32:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,307 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:32:35,307 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:32:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:35,308 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:35,308 INFO L426 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 576247283, now seen corresponding path program 169 times [2020-01-16 18:32:35,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915741741] [2020-01-16 18:32:35,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:35,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-01-16 18:32:35,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915741741] [2020-01-16 18:32:35,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:35,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:35,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47038652] [2020-01-16 18:32:35,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:35,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:35,686 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:32:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,817 INFO L93 Difference]: Finished difference Result 1444 states and 5049 transitions. [2020-01-16 18:32:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:35,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,821 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:32:35,821 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:32:35,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:32:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 797. [2020-01-16 18:32:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:32:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3183 transitions. [2020-01-16 18:32:35,842 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3183 transitions. Word has length 25 [2020-01-16 18:32:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,842 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3183 transitions. [2020-01-16 18:32:35,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3183 transitions. [2020-01-16 18:32:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:35,843 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:35,844 INFO L426 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:35,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1546498897, now seen corresponding path program 170 times [2020-01-16 18:32:35,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525445931] [2020-01-16 18:32:35,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:36,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525445931] [2020-01-16 18:32:36,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:36,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84773885] [2020-01-16 18:32:36,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:36,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:36,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:36,235 INFO L87 Difference]: Start difference. First operand 797 states and 3183 transitions. Second operand 10 states. [2020-01-16 18:32:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,383 INFO L93 Difference]: Finished difference Result 1446 states and 5049 transitions. [2020-01-16 18:32:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:36,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,386 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:32:36,387 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:32:36,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:32:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-01-16 18:32:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3172 transitions. [2020-01-16 18:32:36,408 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3172 transitions. Word has length 25 [2020-01-16 18:32:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,408 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3172 transitions. [2020-01-16 18:32:36,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3172 transitions. [2020-01-16 18:32:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:36,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:36,410 INFO L426 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash 133348143, now seen corresponding path program 171 times [2020-01-16 18:32:36,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933059198] [2020-01-16 18:32:36,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,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-01-16 18:32:36,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933059198] [2020-01-16 18:32:36,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:36,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646339859] [2020-01-16 18:32:36,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:36,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:36,803 INFO L87 Difference]: Start difference. First operand 793 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:32:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,937 INFO L93 Difference]: Finished difference Result 1445 states and 5047 transitions. [2020-01-16 18:32:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:36,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,941 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:32:36,941 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:32:36,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:32:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 797. [2020-01-16 18:32:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:32:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3179 transitions. [2020-01-16 18:32:36,965 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3179 transitions. Word has length 25 [2020-01-16 18:32:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,965 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3179 transitions. [2020-01-16 18:32:36,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3179 transitions. [2020-01-16 18:32:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:36,966 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:36,966 INFO L426 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1124605965, now seen corresponding path program 172 times [2020-01-16 18:32:36,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032900681] [2020-01-16 18:32:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:37,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032900681] [2020-01-16 18:32:37,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:37,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:37,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093915449] [2020-01-16 18:32:37,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:37,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:37,352 INFO L87 Difference]: Start difference. First operand 797 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:32:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:37,486 INFO L93 Difference]: Finished difference Result 1448 states and 5049 transitions. [2020-01-16 18:32:37,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:37,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:37,490 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:32:37,490 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:32:37,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:32:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-01-16 18:32:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3168 transitions. [2020-01-16 18:32:37,512 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:37,513 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3168 transitions. [2020-01-16 18:32:37,513 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3168 transitions. [2020-01-16 18:32:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:37,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:37,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:37,514 INFO L426 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2084246989, now seen corresponding path program 173 times [2020-01-16 18:32:37,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:37,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306976740] [2020-01-16 18:32:37,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:37,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306976740] [2020-01-16 18:32:37,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:37,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:37,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826435412] [2020-01-16 18:32:37,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:37,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:37,901 INFO L87 Difference]: Start difference. First operand 793 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,027 INFO L93 Difference]: Finished difference Result 1451 states and 5057 transitions. [2020-01-16 18:32:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:38,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,031 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:32:38,031 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:32:38,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:32:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-01-16 18:32:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:32:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-01-16 18:32:38,054 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-01-16 18:32:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,054 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-01-16 18:32:38,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-01-16 18:32:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:38,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:38,055 INFO L426 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1137634927, now seen corresponding path program 174 times [2020-01-16 18:32:38,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462236260] [2020-01-16 18:32:38,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:38,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462236260] [2020-01-16 18:32:38,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:38,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509085610] [2020-01-16 18:32:38,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:38,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:38,445 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:32:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,579 INFO L93 Difference]: Finished difference Result 1452 states and 5053 transitions. [2020-01-16 18:32:38,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:38,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,583 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:32:38,583 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:32:38,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:32:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 789. [2020-01-16 18:32:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3157 transitions. [2020-01-16 18:32:38,605 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3157 transitions. Word has length 25 [2020-01-16 18:32:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,605 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3157 transitions. [2020-01-16 18:32:38,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3157 transitions. [2020-01-16 18:32:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:38,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:38,606 INFO L426 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -268724169, now seen corresponding path program 175 times [2020-01-16 18:32:38,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610671938] [2020-01-16 18:32:38,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:38,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610671938] [2020-01-16 18:32:38,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:38,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899990703] [2020-01-16 18:32:38,986 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:38,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:38,986 INFO L87 Difference]: Start difference. First operand 789 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:32:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:39,120 INFO L93 Difference]: Finished difference Result 1449 states and 5055 transitions. [2020-01-16 18:32:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:39,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:39,124 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:32:39,124 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:32:39,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:32:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-01-16 18:32:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:32:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3182 transitions. [2020-01-16 18:32:39,145 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3182 transitions. Word has length 25 [2020-01-16 18:32:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:39,145 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3182 transitions. [2020-01-16 18:32:39,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3182 transitions. [2020-01-16 18:32:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:39,147 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:39,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:39,147 INFO L426 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 701527445, now seen corresponding path program 176 times [2020-01-16 18:32:39,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:39,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807289852] [2020-01-16 18:32:39,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:39,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807289852] [2020-01-16 18:32:39,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:39,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:39,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009979922] [2020-01-16 18:32:39,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:39,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:39,538 INFO L87 Difference]: Start difference. First operand 798 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:32:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:39,675 INFO L93 Difference]: Finished difference Result 1451 states and 5055 transitions. [2020-01-16 18:32:39,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:39,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:39,679 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:32:39,679 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:32:39,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:32:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-01-16 18:32:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3171 transitions. [2020-01-16 18:32:39,701 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3171 transitions. Word has length 25 [2020-01-16 18:32:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:39,701 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3171 transitions. [2020-01-16 18:32:39,701 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3171 transitions. [2020-01-16 18:32:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:39,702 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:39,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:39,703 INFO L426 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1154522449, now seen corresponding path program 177 times [2020-01-16 18:32:39,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:39,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827025095] [2020-01-16 18:32:39,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827025095] [2020-01-16 18:32:40,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:40,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933121418] [2020-01-16 18:32:40,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:40,100 INFO L87 Difference]: Start difference. First operand 794 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:32:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,232 INFO L93 Difference]: Finished difference Result 1453 states and 5058 transitions. [2020-01-16 18:32:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:40,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,236 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:32:40,236 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:32:40,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:32:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 799. [2020-01-16 18:32:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:32:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3180 transitions. [2020-01-16 18:32:40,257 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3180 transitions. Word has length 25 [2020-01-16 18:32:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,258 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3180 transitions. [2020-01-16 18:32:40,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3180 transitions. [2020-01-16 18:32:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:40,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:40,259 INFO L426 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -142258419, now seen corresponding path program 178 times [2020-01-16 18:32:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725300552] [2020-01-16 18:32:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:40,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725300552] [2020-01-16 18:32:40,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:40,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245469620] [2020-01-16 18:32:40,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:40,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:40,643 INFO L87 Difference]: Start difference. First operand 799 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:32:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,756 INFO L93 Difference]: Finished difference Result 1458 states and 5063 transitions. [2020-01-16 18:32:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:40,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,760 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:32:40,760 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:32:40,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:32:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 794. [2020-01-16 18:32:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3166 transitions. [2020-01-16 18:32:40,783 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3166 transitions. Word has length 25 [2020-01-16 18:32:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,783 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3166 transitions. [2020-01-16 18:32:40,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3166 transitions. [2020-01-16 18:32:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:40,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:40,784 INFO L426 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2016941303, now seen corresponding path program 179 times [2020-01-16 18:32:40,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46780930] [2020-01-16 18:32:40,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:41,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-01-16 18:32:41,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46780930] [2020-01-16 18:32:41,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:41,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:41,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433390350] [2020-01-16 18:32:41,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:41,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:41,178 INFO L87 Difference]: Start difference. First operand 794 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:32:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:41,348 INFO L93 Difference]: Finished difference Result 1459 states and 5067 transitions. [2020-01-16 18:32:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:41,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:41,352 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:32:41,352 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:32:41,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:32:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 801. [2020-01-16 18:32:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:32:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3179 transitions. [2020-01-16 18:32:41,375 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3179 transitions. Word has length 25 [2020-01-16 18:32:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:41,375 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3179 transitions. [2020-01-16 18:32:41,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3179 transitions. [2020-01-16 18:32:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:41,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:41,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:41,376 INFO L426 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -129229457, now seen corresponding path program 180 times [2020-01-16 18:32:41,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:41,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962399934] [2020-01-16 18:32:41,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:41,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962399934] [2020-01-16 18:32:41,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:41,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:41,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42047126] [2020-01-16 18:32:41,770 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:41,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:41,771 INFO L87 Difference]: Start difference. First operand 801 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:32:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:41,904 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-01-16 18:32:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:41,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:41,908 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:32:41,908 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:32:41,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:32:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-01-16 18:32:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3152 transitions. [2020-01-16 18:32:41,931 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3152 transitions. Word has length 25 [2020-01-16 18:32:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:41,931 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3152 transitions. [2020-01-16 18:32:41,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3152 transitions. [2020-01-16 18:32:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:41,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:41,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:41,932 INFO L426 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1556594761, now seen corresponding path program 181 times [2020-01-16 18:32:41,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:41,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837020877] [2020-01-16 18:32:41,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,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-01-16 18:32:42,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837020877] [2020-01-16 18:32:42,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:42,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103974437] [2020-01-16 18:32:42,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:42,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:42,317 INFO L87 Difference]: Start difference. First operand 789 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:32:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:42,449 INFO L93 Difference]: Finished difference Result 1454 states and 5060 transitions. [2020-01-16 18:32:42,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:42,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:42,453 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:32:42,453 INFO L226 Difference]: Without dead ends: 1441 [2020-01-16 18:32:42,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-01-16 18:32:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 799. [2020-01-16 18:32:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:32:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-01-16 18:32:42,476 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-01-16 18:32:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:42,476 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-01-16 18:32:42,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-01-16 18:32:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:42,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:42,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:42,477 INFO L426 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -565336939, now seen corresponding path program 182 times [2020-01-16 18:32:42,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:42,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086981299] [2020-01-16 18:32:42,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:42,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086981299] [2020-01-16 18:32:42,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:42,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814703751] [2020-01-16 18:32:42,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:42,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:42,866 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:32:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:43,016 INFO L93 Difference]: Finished difference Result 1457 states and 5062 transitions. [2020-01-16 18:32:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:43,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:43,022 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:32:43,022 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:32:43,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:32:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 795. [2020-01-16 18:32:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-01-16 18:32:43,043 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:43,043 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-01-16 18:32:43,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-01-16 18:32:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:43,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:43,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:43,046 INFO L426 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1999493901, now seen corresponding path program 183 times [2020-01-16 18:32:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:43,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346417089] [2020-01-16 18:32:43,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:43,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346417089] [2020-01-16 18:32:43,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:43,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:43,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103243597] [2020-01-16 18:32:43,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:43,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:43,436 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:43,572 INFO L93 Difference]: Finished difference Result 1457 states and 5061 transitions. [2020-01-16 18:32:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:43,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:43,576 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:32:43,576 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:32:43,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:32:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 800. [2020-01-16 18:32:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:32:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3177 transitions. [2020-01-16 18:32:43,598 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3177 transitions. Word has length 25 [2020-01-16 18:32:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:43,599 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3177 transitions. [2020-01-16 18:32:43,599 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3177 transitions. [2020-01-16 18:32:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:43,600 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:43,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:43,600 INFO L426 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash -987229871, now seen corresponding path program 184 times [2020-01-16 18:32:43,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:43,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081981960] [2020-01-16 18:32:43,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,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-01-16 18:32:44,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081981960] [2020-01-16 18:32:44,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:44,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203050738] [2020-01-16 18:32:44,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:44,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:44,005 INFO L87 Difference]: Start difference. First operand 800 states and 3177 transitions. Second operand 10 states. [2020-01-16 18:32:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,116 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-01-16 18:32:44,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:44,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,119 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:32:44,120 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:32:44,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:32:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 795. [2020-01-16 18:32:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3163 transitions. [2020-01-16 18:32:44,142 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3163 transitions. Word has length 25 [2020-01-16 18:32:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,142 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3163 transitions. [2020-01-16 18:32:44,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3163 transitions. [2020-01-16 18:32:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:44,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:44,144 INFO L426 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 750076919, now seen corresponding path program 185 times [2020-01-16 18:32:44,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628760449] [2020-01-16 18:32:44,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:44,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628760449] [2020-01-16 18:32:44,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:44,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241598519] [2020-01-16 18:32:44,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:44,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:44,544 INFO L87 Difference]: Start difference. First operand 795 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:32:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,680 INFO L93 Difference]: Finished difference Result 1467 states and 5078 transitions. [2020-01-16 18:32:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:44,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,684 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:32:44,684 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:32:44,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:32:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-01-16 18:32:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:32:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3179 transitions. [2020-01-16 18:32:44,707 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3179 transitions. Word has length 25 [2020-01-16 18:32:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,708 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3179 transitions. [2020-01-16 18:32:44,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3179 transitions. [2020-01-16 18:32:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:44,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:44,709 INFO L426 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash -323008461, now seen corresponding path program 186 times [2020-01-16 18:32:44,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695925556] [2020-01-16 18:32:44,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:45,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695925556] [2020-01-16 18:32:45,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:45,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403260204] [2020-01-16 18:32:45,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:45,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:45,133 INFO L87 Difference]: Start difference. First operand 804 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:32:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:45,245 INFO L93 Difference]: Finished difference Result 1469 states and 5074 transitions. [2020-01-16 18:32:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:45,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:45,249 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:32:45,250 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:32:45,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:32:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 789. [2020-01-16 18:32:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:32:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-01-16 18:32:45,272 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-01-16 18:32:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:45,272 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-01-16 18:32:45,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-01-16 18:32:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:45,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:45,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:45,273 INFO L426 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 38876945, now seen corresponding path program 187 times [2020-01-16 18:32:45,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:45,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12888225] [2020-01-16 18:32:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,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-01-16 18:32:45,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12888225] [2020-01-16 18:32:45,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:45,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560196449] [2020-01-16 18:32:45,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:45,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:45,666 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:32:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:45,819 INFO L93 Difference]: Finished difference Result 1469 states and 5093 transitions. [2020-01-16 18:32:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:45,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:45,822 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:32:45,822 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:32:45,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:32:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 804. [2020-01-16 18:32:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:32:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3186 transitions. [2020-01-16 18:32:45,844 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3186 transitions. Word has length 25 [2020-01-16 18:32:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:45,844 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3186 transitions. [2020-01-16 18:32:45,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3186 transitions. [2020-01-16 18:32:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:45,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:45,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:45,846 INFO L426 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1034208435, now seen corresponding path program 188 times [2020-01-16 18:32:45,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:45,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30954635] [2020-01-16 18:32:45,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:46,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30954635] [2020-01-16 18:32:46,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:46,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:46,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376041872] [2020-01-16 18:32:46,236 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:46,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:46,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:46,237 INFO L87 Difference]: Start difference. First operand 804 states and 3186 transitions. Second operand 10 states. [2020-01-16 18:32:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,407 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-01-16 18:32:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:46,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,411 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:32:46,412 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:32:46,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:32:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 798. [2020-01-16 18:32:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:32:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-01-16 18:32:46,437 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-01-16 18:32:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:46,438 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-01-16 18:32:46,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-01-16 18:32:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:46,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:46,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:46,439 INFO L426 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1132968533, now seen corresponding path program 189 times [2020-01-16 18:32:46,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:46,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680613834] [2020-01-16 18:32:46,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:46,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-01-16 18:32:46,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680613834] [2020-01-16 18:32:46,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:46,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:46,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869249685] [2020-01-16 18:32:46,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:46,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:46,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:46,855 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:32:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,994 INFO L93 Difference]: Finished difference Result 1472 states and 5092 transitions. [2020-01-16 18:32:46,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:46,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,998 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:32:46,998 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:32:46,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:32:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 805. [2020-01-16 18:32:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:32:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3182 transitions. [2020-01-16 18:32:47,020 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3182 transitions. Word has length 25 [2020-01-16 18:32:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,020 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3182 transitions. [2020-01-16 18:32:47,020 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3182 transitions. [2020-01-16 18:32:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:47,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:47,021 INFO L426 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1013202227, now seen corresponding path program 190 times [2020-01-16 18:32:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105410175] [2020-01-16 18:32:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105410175] [2020-01-16 18:32:47,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:47,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711861] [2020-01-16 18:32:47,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:47,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:47,423 INFO L87 Difference]: Start difference. First operand 805 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:32:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:47,534 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-01-16 18:32:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:47,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:47,538 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:32:47,538 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:32:47,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:32:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-01-16 18:32:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:32:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3162 transitions. [2020-01-16 18:32:47,560 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3162 transitions. Word has length 25 [2020-01-16 18:32:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,560 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3162 transitions. [2020-01-16 18:32:47,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3162 transitions. [2020-01-16 18:32:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:47,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:47,562 INFO L426 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1153974741, now seen corresponding path program 191 times [2020-01-16 18:32:47,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936581810] [2020-01-16 18:32:47,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936581810] [2020-01-16 18:32:47,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:47,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201186312] [2020-01-16 18:32:47,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:47,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:47,969 INFO L87 Difference]: Start difference. First operand 798 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:32:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:48,104 INFO L93 Difference]: Finished difference Result 1476 states and 5093 transitions. [2020-01-16 18:32:48,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:48,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:48,107 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:32:48,108 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:32:48,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:32:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 807. [2020-01-16 18:32:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:32:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3178 transitions. [2020-01-16 18:32:48,129 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3178 transitions. Word has length 25 [2020-01-16 18:32:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:48,129 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3178 transitions. [2020-01-16 18:32:48,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3178 transitions. [2020-01-16 18:32:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:48,130 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:48,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:48,130 INFO L426 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash 80889361, now seen corresponding path program 192 times [2020-01-16 18:32:48,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:48,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42283347] [2020-01-16 18:32:48,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:48,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-01-16 18:32:48,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42283347] [2020-01-16 18:32:48,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:48,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:48,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627749066] [2020-01-16 18:32:48,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:48,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:48,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:48,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:48,547 INFO L87 Difference]: Start difference. First operand 807 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:32:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:48,661 INFO L93 Difference]: Finished difference Result 1478 states and 5089 transitions. [2020-01-16 18:32:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:48,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:48,665 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:32:48,665 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:32:48,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:32:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 782. [2020-01-16 18:32:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:32:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:32:48,687 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:32:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:48,687 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:32:48,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:32:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:48,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:48,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:48,688 INFO L426 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1867640017, now seen corresponding path program 193 times [2020-01-16 18:32:48,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:48,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490238736] [2020-01-16 18:32:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:49,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490238736] [2020-01-16 18:32:49,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:49,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522991172] [2020-01-16 18:32:49,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:49,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:49,082 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:32:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,222 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-01-16 18:32:49,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:49,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,226 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:32:49,226 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:32:49,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:32:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 793. [2020-01-16 18:32:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-01-16 18:32:49,247 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-01-16 18:32:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,247 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-01-16 18:32:49,247 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-01-16 18:32:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:49,248 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,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] [2020-01-16 18:32:49,249 INFO L426 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1446572561, now seen corresponding path program 194 times [2020-01-16 18:32:49,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37621000] [2020-01-16 18:32:49,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:49,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37621000] [2020-01-16 18:32:49,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:49,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279803748] [2020-01-16 18:32:49,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:49,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:49,632 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:32:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,765 INFO L93 Difference]: Finished difference Result 1413 states and 4952 transitions. [2020-01-16 18:32:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:49,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,768 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:32:49,769 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:49,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 790. [2020-01-16 18:32:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3156 transitions. [2020-01-16 18:32:49,790 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3156 transitions. Word has length 25 [2020-01-16 18:32:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,790 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3156 transitions. [2020-01-16 18:32:49,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3156 transitions. [2020-01-16 18:32:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:49,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:49,791 INFO L426 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash -501293201, now seen corresponding path program 195 times [2020-01-16 18:32:49,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592470855] [2020-01-16 18:32:49,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592470855] [2020-01-16 18:32:50,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:50,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491374189] [2020-01-16 18:32:50,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:50,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:50,192 INFO L87 Difference]: Start difference. First operand 790 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:32:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,328 INFO L93 Difference]: Finished difference Result 1419 states and 4965 transitions. [2020-01-16 18:32:50,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:50,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,332 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:32:50,332 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:32:50,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:32:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:32:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3163 transitions. [2020-01-16 18:32:50,353 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3163 transitions. Word has length 25 [2020-01-16 18:32:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,353 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3163 transitions. [2020-01-16 18:32:50,353 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3163 transitions. [2020-01-16 18:32:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:50,354 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:50,354 INFO L426 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 489964621, now seen corresponding path program 196 times [2020-01-16 18:32:50,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957134527] [2020-01-16 18:32:50,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957134527] [2020-01-16 18:32:50,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:50,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683095079] [2020-01-16 18:32:50,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:50,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:50,738 INFO L87 Difference]: Start difference. First operand 794 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:32:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,898 INFO L93 Difference]: Finished difference Result 1422 states and 4967 transitions. [2020-01-16 18:32:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:50,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,902 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:32:50,902 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:32:50,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:32:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:32:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:32:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-01-16 18:32:50,924 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-01-16 18:32:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,924 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-01-16 18:32:50,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-01-16 18:32:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:50,925 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:50,925 INFO L426 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash -782351151, now seen corresponding path program 197 times [2020-01-16 18:32:50,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678529870] [2020-01-16 18:32:50,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:51,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678529870] [2020-01-16 18:32:51,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:51,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029249328] [2020-01-16 18:32:51,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:51,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:51,306 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:32:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,439 INFO L93 Difference]: Finished difference Result 1416 states and 4955 transitions. [2020-01-16 18:32:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:51,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,443 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:32:51,443 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:32:51,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:32:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 793. [2020-01-16 18:32:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3158 transitions. [2020-01-16 18:32:51,465 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3158 transitions. Word has length 25 [2020-01-16 18:32:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:51,465 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3158 transitions. [2020-01-16 18:32:51,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3158 transitions. [2020-01-16 18:32:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:51,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:51,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:51,467 INFO L426 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 828589807, now seen corresponding path program 198 times [2020-01-16 18:32:51,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:51,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523584704] [2020-01-16 18:32:51,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523584704] [2020-01-16 18:32:51,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:51,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206563905] [2020-01-16 18:32:51,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:51,852 INFO L87 Difference]: Start difference. First operand 793 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:32:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,988 INFO L93 Difference]: Finished difference Result 1420 states and 4960 transitions. [2020-01-16 18:32:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:51,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,992 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:32:51,992 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:32:51,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:32:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 787. [2020-01-16 18:32:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:32:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-01-16 18:32:52,013 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-01-16 18:32:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:52,013 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-01-16 18:32:52,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-01-16 18:32:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:52,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:52,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:52,014 INFO L426 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1022668565, now seen corresponding path program 199 times [2020-01-16 18:32:52,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:52,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045900579] [2020-01-16 18:32:52,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:52,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045900579] [2020-01-16 18:32:52,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:52,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860095901] [2020-01-16 18:32:52,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:52,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:52,411 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:32:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:52,550 INFO L93 Difference]: Finished difference Result 1419 states and 4964 transitions. [2020-01-16 18:32:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:52,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:52,554 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:32:52,554 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:32:52,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:32:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:32:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:32:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:32:52,576 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:32:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:52,577 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:32:52,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:32:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:52,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:52,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:52,578 INFO L426 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2003423283, now seen corresponding path program 200 times [2020-01-16 18:32:52,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:52,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773275676] [2020-01-16 18:32:52,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:52,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773275676] [2020-01-16 18:32:52,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:52,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179096026] [2020-01-16 18:32:52,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:52,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:52,980 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:32:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,115 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-01-16 18:32:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:53,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,118 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:32:53,119 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:32:53,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:32:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 791. [2020-01-16 18:32:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-01-16 18:32:53,140 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-01-16 18:32:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,140 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-01-16 18:32:53,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-01-16 18:32:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:53,141 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:53,142 INFO L426 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1789163793, now seen corresponding path program 201 times [2020-01-16 18:32:53,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758787497] [2020-01-16 18:32:53,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:53,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-01-16 18:32:53,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758787497] [2020-01-16 18:32:53,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:53,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:53,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805571191] [2020-01-16 18:32:53,547 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:53,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:53,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:53,547 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:32:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,682 INFO L93 Difference]: Finished difference Result 1427 states and 4977 transitions. [2020-01-16 18:32:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:53,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,686 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:32:53,686 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:32:53,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:32:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-01-16 18:32:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:32:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3165 transitions. [2020-01-16 18:32:53,718 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3165 transitions. Word has length 25 [2020-01-16 18:32:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,718 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3165 transitions. [2020-01-16 18:32:53,718 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3165 transitions. [2020-01-16 18:32:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:53,719 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,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] [2020-01-16 18:32:53,720 INFO L426 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -776899763, now seen corresponding path program 202 times [2020-01-16 18:32:53,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759111128] [2020-01-16 18:32:53,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:54,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759111128] [2020-01-16 18:32:54,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:54,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889679883] [2020-01-16 18:32:54,113 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:54,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:54,113 INFO L87 Difference]: Start difference. First operand 796 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:32:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,245 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-01-16 18:32:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:54,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,249 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:32:54,249 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:32:54,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:32:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 791. [2020-01-16 18:32:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:32:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-01-16 18:32:54,270 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-01-16 18:32:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,270 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-01-16 18:32:54,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-01-16 18:32:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:54,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:54,272 INFO L426 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -976130155, now seen corresponding path program 203 times [2020-01-16 18:32:54,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022712906] [2020-01-16 18:32:54,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,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-01-16 18:32:54,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022712906] [2020-01-16 18:32:54,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:54,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903426931] [2020-01-16 18:32:54,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:54,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:54,652 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:32:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,822 INFO L93 Difference]: Finished difference Result 1424 states and 4966 transitions. [2020-01-16 18:32:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:54,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,826 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:32:54,827 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:32:54,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:32:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:32:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3159 transitions. [2020-01-16 18:32:54,855 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3159 transitions. Word has length 25 [2020-01-16 18:32:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,856 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3159 transitions. [2020-01-16 18:32:54,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3159 transitions. [2020-01-16 18:32:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:54,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:54,857 INFO L426 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash -438274577, now seen corresponding path program 204 times [2020-01-16 18:32:54,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178738192] [2020-01-16 18:32:54,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178738192] [2020-01-16 18:32:55,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:55,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746876366] [2020-01-16 18:32:55,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:55,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:55,248 INFO L87 Difference]: Start difference. First operand 795 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:32:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:55,367 INFO L93 Difference]: Finished difference Result 1430 states and 4974 transitions. [2020-01-16 18:32:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:55,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:55,371 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:32:55,371 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:32:55,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:32:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 787. [2020-01-16 18:32:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:32:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:32:55,392 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:32:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:55,393 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:32:55,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:32:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:55,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:55,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:55,394 INFO L426 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1768750379, now seen corresponding path program 205 times [2020-01-16 18:32:55,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:55,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392827901] [2020-01-16 18:32:55,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392827901] [2020-01-16 18:32:55,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:55,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283525763] [2020-01-16 18:32:55,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:55,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:55,796 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:32:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:55,931 INFO L93 Difference]: Finished difference Result 1436 states and 5001 transitions. [2020-01-16 18:32:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:55,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:55,935 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:32:55,935 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:32:55,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:32:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 797. [2020-01-16 18:32:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:32:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:32:55,957 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:55,958 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:32:55,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:32:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:55,959 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:55,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:55,959 INFO L426 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash -777492557, now seen corresponding path program 206 times [2020-01-16 18:32:55,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:55,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048752445] [2020-01-16 18:32:55,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:56,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048752445] [2020-01-16 18:32:56,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:56,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:56,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297819931] [2020-01-16 18:32:56,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:56,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:56,347 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:56,484 INFO L93 Difference]: Finished difference Result 1439 states and 5003 transitions. [2020-01-16 18:32:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:56,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:56,487 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:32:56,487 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:32:56,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:32:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 793. [2020-01-16 18:32:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:32:56,509 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:32:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:56,509 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:32:56,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:32:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:56,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:56,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:56,511 INFO L426 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2083317777, now seen corresponding path program 207 times [2020-01-16 18:32:56,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:56,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349544078] [2020-01-16 18:32:56,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:56,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-01-16 18:32:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349544078] [2020-01-16 18:32:56,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:56,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:56,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630302844] [2020-01-16 18:32:56,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:56,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:56,900 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:32:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,038 INFO L93 Difference]: Finished difference Result 1439 states and 5002 transitions. [2020-01-16 18:32:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:57,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,041 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:32:57,041 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:32:57,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:32:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-01-16 18:32:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:32:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-01-16 18:32:57,063 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-01-16 18:32:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,063 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-01-16 18:32:57,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-01-16 18:32:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:57,064 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:57,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:57,064 INFO L426 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1199385489, now seen corresponding path program 208 times [2020-01-16 18:32:57,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153778552] [2020-01-16 18:32:57,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:57,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153778552] [2020-01-16 18:32:57,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:57,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:57,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348398914] [2020-01-16 18:32:57,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:57,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:57,473 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:32:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,615 INFO L93 Difference]: Finished difference Result 1444 states and 5007 transitions. [2020-01-16 18:32:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:57,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,619 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:32:57,619 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:32:57,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:32:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 793. [2020-01-16 18:32:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:32:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:32:57,641 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:32:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,641 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:32:57,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:32:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:57,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:57,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:57,642 INFO L426 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 537921301, now seen corresponding path program 209 times [2020-01-16 18:32:57,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658385459] [2020-01-16 18:32:57,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,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-01-16 18:32:58,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658385459] [2020-01-16 18:32:58,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:58,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466887378] [2020-01-16 18:32:58,040 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:58,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:58,041 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:32:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:58,187 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-01-16 18:32:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:58,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:58,190 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:32:58,191 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:32:58,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:32:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-01-16 18:32:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:32:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3168 transitions. [2020-01-16 18:32:58,212 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3168 transitions. Word has length 25 [2020-01-16 18:32:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:58,212 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3168 transitions. [2020-01-16 18:32:58,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3168 transitions. [2020-01-16 18:32:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:58,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:58,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:58,214 INFO L426 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -535164079, now seen corresponding path program 210 times [2020-01-16 18:32:58,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:58,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605040752] [2020-01-16 18:32:58,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,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-01-16 18:32:58,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605040752] [2020-01-16 18:32:58,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:58,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272899728] [2020-01-16 18:32:58,617 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:58,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:58,617 INFO L87 Difference]: Start difference. First operand 802 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:32:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:58,729 INFO L93 Difference]: Finished difference Result 1451 states and 5015 transitions. [2020-01-16 18:32:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:58,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:58,738 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:32:58,738 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:32:58,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:32:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 787. [2020-01-16 18:32:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:32:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-01-16 18:32:58,770 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-01-16 18:32:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:58,771 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-01-16 18:32:58,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-01-16 18:32:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:58,772 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:58,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:58,773 INFO L426 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1340772783, now seen corresponding path program 211 times [2020-01-16 18:32:58,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:58,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793871287] [2020-01-16 18:32:58,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:59,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793871287] [2020-01-16 18:32:59,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:59,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:59,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339432881] [2020-01-16 18:32:59,170 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:59,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:59,170 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:32:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,308 INFO L93 Difference]: Finished difference Result 1429 states and 4977 transitions. [2020-01-16 18:32:59,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:59,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,312 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:32:59,312 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:32:59,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:32:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 795. [2020-01-16 18:32:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:32:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-01-16 18:32:59,333 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-01-16 18:32:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,334 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-01-16 18:32:59,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-01-16 18:32:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:59,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:59,335 INFO L426 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253555, now seen corresponding path program 212 times [2020-01-16 18:32:59,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069785672] [2020-01-16 18:32:59,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:59,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069785672] [2020-01-16 18:32:59,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:59,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:32:59,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291208853] [2020-01-16 18:32:59,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:32:59,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:59,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:32:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:32:59,718 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:32:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,865 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-01-16 18:32:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:32:59,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:32:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,869 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:32:59,869 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:32:59,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:32:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:32:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 792. [2020-01-16 18:32:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:32:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:32:59,894 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:32:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,894 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:32:59,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:32:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:32:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:32:59,895 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:59,895 INFO L426 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:32:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1860102925, now seen corresponding path program 213 times [2020-01-16 18:32:59,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044868147] [2020-01-16 18:32:59,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:00,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044868147] [2020-01-16 18:33:00,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:00,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767690453] [2020-01-16 18:33:00,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:00,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:00,270 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,397 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-01-16 18:33:00,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:00,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,401 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:33:00,402 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:33:00,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:33:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 796. [2020-01-16 18:33:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-01-16 18:33:00,425 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-01-16 18:33:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:00,425 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-01-16 18:33:00,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-01-16 18:33:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:00,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:00,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:00,426 INFO L426 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1322247347, now seen corresponding path program 214 times [2020-01-16 18:33:00,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:00,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342175414] [2020-01-16 18:33:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,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-01-16 18:33:00,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342175414] [2020-01-16 18:33:00,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:00,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882137260] [2020-01-16 18:33:00,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:00,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:00,826 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:33:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,966 INFO L93 Difference]: Finished difference Result 1438 states and 4987 transitions. [2020-01-16 18:33:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:00,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,970 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:33:00,970 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:33:00,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:33:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 792. [2020-01-16 18:33:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:33:01,004 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:33:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,004 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:33:01,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:33:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:01,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:01,006 INFO L426 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1849599821, now seen corresponding path program 215 times [2020-01-16 18:33:01,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414000268] [2020-01-16 18:33:01,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:01,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414000268] [2020-01-16 18:33:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:01,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:01,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369073333] [2020-01-16 18:33:01,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:01,393 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:33:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:01,528 INFO L93 Difference]: Finished difference Result 1445 states and 5004 transitions. [2020-01-16 18:33:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:01,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:01,532 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:33:01,532 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:33:01,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:33:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 801. [2020-01-16 18:33:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:33:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3161 transitions. [2020-01-16 18:33:01,555 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,555 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3161 transitions. [2020-01-16 18:33:01,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3161 transitions. [2020-01-16 18:33:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:01,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:01,556 INFO L426 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1372282095, now seen corresponding path program 216 times [2020-01-16 18:33:01,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658170775] [2020-01-16 18:33:01,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:01,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658170775] [2020-01-16 18:33:01,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:01,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:01,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083790853] [2020-01-16 18:33:01,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:01,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:01,957 INFO L87 Difference]: Start difference. First operand 801 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,071 INFO L93 Difference]: Finished difference Result 1447 states and 5000 transitions. [2020-01-16 18:33:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:02,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,075 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:33:02,075 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:33:02,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:33:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 782. [2020-01-16 18:33:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:33:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3122 transitions. [2020-01-16 18:33:02,097 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3122 transitions. Word has length 25 [2020-01-16 18:33:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,097 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3122 transitions. [2020-01-16 18:33:02,097 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3122 transitions. [2020-01-16 18:33:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:02,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,098 INFO L426 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -842530889, now seen corresponding path program 217 times [2020-01-16 18:33:02,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609773578] [2020-01-16 18:33:02,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:02,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609773578] [2020-01-16 18:33:02,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:02,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:02,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399681368] [2020-01-16 18:33:02,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:02,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:02,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:02,489 INFO L87 Difference]: Start difference. First operand 782 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:33:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,631 INFO L93 Difference]: Finished difference Result 1432 states and 4997 transitions. [2020-01-16 18:33:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:02,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,635 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:33:02,635 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:33:02,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:33:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-01-16 18:33:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3161 transitions. [2020-01-16 18:33:02,658 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,658 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3161 transitions. [2020-01-16 18:33:02,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3161 transitions. [2020-01-16 18:33:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:02,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,659 INFO L426 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 768410069, now seen corresponding path program 218 times [2020-01-16 18:33:02,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213121930] [2020-01-16 18:33:02,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:03,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213121930] [2020-01-16 18:33:03,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:03,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:03,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125170491] [2020-01-16 18:33:03,050 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:03,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:03,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:03,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:03,050 INFO L87 Difference]: Start difference. First operand 794 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:03,193 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:33:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:03,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:03,198 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:33:03,198 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:33:03,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:33:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-01-16 18:33:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3153 transitions. [2020-01-16 18:33:03,219 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3153 transitions. Word has length 25 [2020-01-16 18:33:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:03,219 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3153 transitions. [2020-01-16 18:33:03,219 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3153 transitions. [2020-01-16 18:33:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:03,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:03,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:03,221 INFO L426 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:03,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:03,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1851998553, now seen corresponding path program 219 times [2020-01-16 18:33:03,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:03,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281295730] [2020-01-16 18:33:03,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:03,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281295730] [2020-01-16 18:33:03,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:03,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:03,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304735340] [2020-01-16 18:33:03,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:03,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:03,623 INFO L87 Difference]: Start difference. First operand 791 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:33:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:03,773 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-01-16 18:33:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:03,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:03,777 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:33:03,777 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:33:03,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:33:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-01-16 18:33:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3164 transitions. [2020-01-16 18:33:03,798 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3164 transitions. Word has length 25 [2020-01-16 18:33:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:03,798 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3164 transitions. [2020-01-16 18:33:03,799 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3164 transitions. [2020-01-16 18:33:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:03,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:03,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:03,800 INFO L426 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash 778913173, now seen corresponding path program 220 times [2020-01-16 18:33:03,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:03,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040197417] [2020-01-16 18:33:03,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040197417] [2020-01-16 18:33:04,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:04,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002082613] [2020-01-16 18:33:04,190 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:04,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:04,191 INFO L87 Difference]: Start difference. First operand 797 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:33:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,332 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-01-16 18:33:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:04,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,336 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:33:04,336 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:33:04,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:33:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-01-16 18:33:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:33:04,358 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,358 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:33:04,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:33:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:04,359 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,359 INFO L426 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1862501657, now seen corresponding path program 221 times [2020-01-16 18:33:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475301109] [2020-01-16 18:33:04,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475301109] [2020-01-16 18:33:04,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:04,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114688350] [2020-01-16 18:33:04,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:04,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:04,756 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,914 INFO L93 Difference]: Finished difference Result 1430 states and 4987 transitions. [2020-01-16 18:33:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:04,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,918 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:33:04,918 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:33:04,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:33:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-01-16 18:33:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-01-16 18:33:04,945 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-01-16 18:33:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,945 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-01-16 18:33:04,945 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-01-16 18:33:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:04,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,946 INFO L426 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -821524681, now seen corresponding path program 222 times [2020-01-16 18:33:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561929811] [2020-01-16 18:33:04,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561929811] [2020-01-16 18:33:05,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:05,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518694745] [2020-01-16 18:33:05,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:05,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:05,340 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:33:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:05,480 INFO L93 Difference]: Finished difference Result 1434 states and 4992 transitions. [2020-01-16 18:33:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:05,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:05,484 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:33:05,484 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:33:05,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:33:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 788. [2020-01-16 18:33:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:33:05,507 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:33:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:05,507 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:33:05,507 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:33:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:05,508 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:05,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:05,509 INFO L426 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1285430029, now seen corresponding path program 223 times [2020-01-16 18:33:05,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:05,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031008362] [2020-01-16 18:33:05,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031008362] [2020-01-16 18:33:05,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:05,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415489081] [2020-01-16 18:33:05,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:05,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:05,900 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:33:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,038 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-01-16 18:33:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:06,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,042 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:33:06,042 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:33:06,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:33:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-01-16 18:33:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:33:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-01-16 18:33:06,063 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,063 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-01-16 18:33:06,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-01-16 18:33:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:06,064 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,065 INFO L426 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 325510929, now seen corresponding path program 224 times [2020-01-16 18:33:06,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409831254] [2020-01-16 18:33:06,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:06,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409831254] [2020-01-16 18:33:06,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:06,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:06,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418327479] [2020-01-16 18:33:06,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:06,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:06,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:06,453 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,593 INFO L93 Difference]: Finished difference Result 1434 states and 4995 transitions. [2020-01-16 18:33:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:06,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,597 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:33:06,597 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:33:06,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:33:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-01-16 18:33:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-01-16 18:33:06,619 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-01-16 18:33:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,619 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-01-16 18:33:06,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-01-16 18:33:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:06,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,621 INFO L426 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1791776295, now seen corresponding path program 225 times [2020-01-16 18:33:06,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504798790] [2020-01-16 18:33:06,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:07,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504798790] [2020-01-16 18:33:07,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:07,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213529595] [2020-01-16 18:33:07,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:07,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:07,004 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:33:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,159 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-01-16 18:33:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:07,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,163 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:33:07,163 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:33:07,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:33:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 799. [2020-01-16 18:33:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:33:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3166 transitions. [2020-01-16 18:33:07,187 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3166 transitions. Word has length 25 [2020-01-16 18:33:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,187 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3166 transitions. [2020-01-16 18:33:07,187 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3166 transitions. [2020-01-16 18:33:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:07,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:07,188 INFO L426 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 357020241, now seen corresponding path program 226 times [2020-01-16 18:33:07,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746817174] [2020-01-16 18:33:07,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:07,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746817174] [2020-01-16 18:33:07,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:07,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570076339] [2020-01-16 18:33:07,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:07,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:07,591 INFO L87 Difference]: Start difference. First operand 799 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:33:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,707 INFO L93 Difference]: Finished difference Result 1450 states and 5022 transitions. [2020-01-16 18:33:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:07,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,711 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:33:07,712 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:33:07,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:33:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 792. [2020-01-16 18:33:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:33:07,733 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,733 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:33:07,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:33:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:07,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:07,735 INFO L426 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1781273191, now seen corresponding path program 227 times [2020-01-16 18:33:07,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125823691] [2020-01-16 18:33:07,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:08,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125823691] [2020-01-16 18:33:08,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:08,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350072104] [2020-01-16 18:33:08,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:08,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:08,128 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,291 INFO L93 Difference]: Finished difference Result 1438 states and 4998 transitions. [2020-01-16 18:33:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:08,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,295 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:33:08,295 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:33:08,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:33:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 796. [2020-01-16 18:33:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-01-16 18:33:08,329 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-01-16 18:33:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,329 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-01-16 18:33:08,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-01-16 18:33:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:08,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:08,330 INFO L426 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1243417613, now seen corresponding path program 228 times [2020-01-16 18:33:08,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27510340] [2020-01-16 18:33:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,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-01-16 18:33:08,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27510340] [2020-01-16 18:33:08,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:08,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061159855] [2020-01-16 18:33:08,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:08,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:08,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:08,730 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:33:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,850 INFO L93 Difference]: Finished difference Result 1444 states and 5006 transitions. [2020-01-16 18:33:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:08,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,854 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:33:08,854 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:33:08,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:33:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 788. [2020-01-16 18:33:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:33:08,876 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:33:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,876 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:33:08,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:33:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:08,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:08,878 INFO L426 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:08,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash -959833805, now seen corresponding path program 229 times [2020-01-16 18:33:08,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998746696] [2020-01-16 18:33:08,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998746696] [2020-01-16 18:33:09,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:09,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732610770] [2020-01-16 18:33:09,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:09,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:09,287 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:33:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:09,428 INFO L93 Difference]: Finished difference Result 1461 states and 5062 transitions. [2020-01-16 18:33:09,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:09,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:09,432 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:33:09,432 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:33:09,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:33:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 803. [2020-01-16 18:33:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:33:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3178 transitions. [2020-01-16 18:33:09,456 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3178 transitions. Word has length 25 [2020-01-16 18:33:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:09,456 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3178 transitions. [2020-01-16 18:33:09,456 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3178 transitions. [2020-01-16 18:33:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:09,457 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:09,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:09,457 INFO L426 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2032919185, now seen corresponding path program 230 times [2020-01-16 18:33:09,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:09,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183702372] [2020-01-16 18:33:09,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183702372] [2020-01-16 18:33:09,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:09,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514549413] [2020-01-16 18:33:09,857 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:09,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:09,857 INFO L87 Difference]: Start difference. First operand 803 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:33:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,020 INFO L93 Difference]: Finished difference Result 1462 states and 5058 transitions. [2020-01-16 18:33:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:10,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,024 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:33:10,024 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:33:10,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:33:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 797. [2020-01-16 18:33:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:33:10,050 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,050 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:33:10,050 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:33:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:10,051 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:10,051 INFO L426 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash 134257783, now seen corresponding path program 231 times [2020-01-16 18:33:10,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30806116] [2020-01-16 18:33:10,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:10,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30806116] [2020-01-16 18:33:10,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:10,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:10,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075027698] [2020-01-16 18:33:10,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:10,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:10,455 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,631 INFO L93 Difference]: Finished difference Result 1464 states and 5061 transitions. [2020-01-16 18:33:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:10,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,635 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:33:10,636 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:33:10,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:33:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 804. [2020-01-16 18:33:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:33:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-01-16 18:33:10,658 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-01-16 18:33:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,658 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-01-16 18:33:10,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-01-16 18:33:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:10,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:10,659 INFO L426 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2011912977, now seen corresponding path program 232 times [2020-01-16 18:33:10,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113095271] [2020-01-16 18:33:10,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,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-01-16 18:33:11,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113095271] [2020-01-16 18:33:11,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:11,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829783808] [2020-01-16 18:33:11,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:11,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:11,070 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:33:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:11,184 INFO L93 Difference]: Finished difference Result 1467 states and 5060 transitions. [2020-01-16 18:33:11,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:11,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:11,188 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:33:11,188 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:33:11,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:33:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 797. [2020-01-16 18:33:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-01-16 18:33:11,219 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:11,220 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-01-16 18:33:11,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-01-16 18:33:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:11,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:11,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:11,221 INFO L426 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash 155263991, now seen corresponding path program 233 times [2020-01-16 18:33:11,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:11,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616385088] [2020-01-16 18:33:11,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,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-01-16 18:33:11,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616385088] [2020-01-16 18:33:11,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:11,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606642113] [2020-01-16 18:33:11,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:11,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:11,628 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:11,770 INFO L93 Difference]: Finished difference Result 1468 states and 5062 transitions. [2020-01-16 18:33:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:11,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:11,774 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:33:11,774 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:33:11,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:33:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 806. [2020-01-16 18:33:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:33:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3170 transitions. [2020-01-16 18:33:11,797 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3170 transitions. Word has length 25 [2020-01-16 18:33:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:11,797 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3170 transitions. [2020-01-16 18:33:11,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3170 transitions. [2020-01-16 18:33:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:11,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:11,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:11,798 INFO L426 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash -917821389, now seen corresponding path program 234 times [2020-01-16 18:33:11,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:11,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434552177] [2020-01-16 18:33:11,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:12,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434552177] [2020-01-16 18:33:12,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:12,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:12,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133020094] [2020-01-16 18:33:12,219 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:12,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:12,220 INFO L87 Difference]: Start difference. First operand 806 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:33:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,385 INFO L93 Difference]: Finished difference Result 1470 states and 5058 transitions. [2020-01-16 18:33:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:12,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,389 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:33:12,389 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:33:12,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:33:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 788. [2020-01-16 18:33:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3132 transitions. [2020-01-16 18:33:12,411 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3132 transitions. Word has length 25 [2020-01-16 18:33:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,411 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3132 transitions. [2020-01-16 18:33:12,411 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3132 transitions. [2020-01-16 18:33:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:12,412 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:12,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:12,412 INFO L426 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash 976703377, now seen corresponding path program 235 times [2020-01-16 18:33:12,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282733284] [2020-01-16 18:33:12,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:12,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282733284] [2020-01-16 18:33:12,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:12,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:12,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238948441] [2020-01-16 18:33:12,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:12,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:12,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:12,798 INFO L87 Difference]: Start difference. First operand 788 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:33:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,961 INFO L93 Difference]: Finished difference Result 1439 states and 4998 transitions. [2020-01-16 18:33:12,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:12,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,965 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:33:12,965 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:33:12,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:33:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 796. [2020-01-16 18:33:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-01-16 18:33:12,987 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-01-16 18:33:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,987 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-01-16 18:33:12,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-01-16 18:33:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:12,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:12,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:12,988 INFO L426 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1707322961, now seen corresponding path program 236 times [2020-01-16 18:33:12,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239420752] [2020-01-16 18:33:12,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,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-01-16 18:33:13,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239420752] [2020-01-16 18:33:13,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679482229] [2020-01-16 18:33:13,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:13,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:13,379 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:33:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:13,521 INFO L93 Difference]: Finished difference Result 1443 states and 5003 transitions. [2020-01-16 18:33:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:13,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:13,525 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:33:13,525 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:33:13,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:33:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-01-16 18:33:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-01-16 18:33:13,546 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-01-16 18:33:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:13,546 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-01-16 18:33:13,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-01-16 18:33:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:13,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:13,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:13,548 INFO L426 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2070794965, now seen corresponding path program 237 times [2020-01-16 18:33:13,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:13,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750031032] [2020-01-16 18:33:13,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:13,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750031032] [2020-01-16 18:33:13,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:13,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57299988] [2020-01-16 18:33:13,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:13,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:13,942 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:33:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,082 INFO L93 Difference]: Finished difference Result 1442 states and 5000 transitions. [2020-01-16 18:33:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:14,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,086 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:33:14,087 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:33:14,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:33:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2020-01-16 18:33:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3152 transitions. [2020-01-16 18:33:14,111 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3152 transitions. Word has length 25 [2020-01-16 18:33:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,111 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3152 transitions. [2020-01-16 18:33:14,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3152 transitions. [2020-01-16 18:33:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:14,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:14,112 INFO L426 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1686316753, now seen corresponding path program 238 times [2020-01-16 18:33:14,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129393669] [2020-01-16 18:33:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:14,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129393669] [2020-01-16 18:33:14,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:14,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:14,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466086822] [2020-01-16 18:33:14,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:14,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:14,520 INFO L87 Difference]: Start difference. First operand 797 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:33:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,648 INFO L93 Difference]: Finished difference Result 1448 states and 5008 transitions. [2020-01-16 18:33:14,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:14,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,652 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:33:14,652 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:33:14,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:33:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 793. [2020-01-16 18:33:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3141 transitions. [2020-01-16 18:33:14,674 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3141 transitions. Word has length 25 [2020-01-16 18:33:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,675 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3141 transitions. [2020-01-16 18:33:14,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3141 transitions. [2020-01-16 18:33:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:14,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,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] [2020-01-16 18:33:14,676 INFO L426 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2081298069, now seen corresponding path program 239 times [2020-01-16 18:33:14,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728203650] [2020-01-16 18:33:14,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:15,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728203650] [2020-01-16 18:33:15,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:15,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:15,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293535589] [2020-01-16 18:33:15,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:15,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:15,078 INFO L87 Difference]: Start difference. First operand 793 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:33:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:15,216 INFO L93 Difference]: Finished difference Result 1455 states and 5025 transitions. [2020-01-16 18:33:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:15,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:15,220 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:33:15,220 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:33:15,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:33:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 802. [2020-01-16 18:33:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:33:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3157 transitions. [2020-01-16 18:33:15,243 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3157 transitions. Word has length 25 [2020-01-16 18:33:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:15,243 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3157 transitions. [2020-01-16 18:33:15,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3157 transitions. [2020-01-16 18:33:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:15,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:15,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:15,245 INFO L426 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1008212689, now seen corresponding path program 240 times [2020-01-16 18:33:15,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:15,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29614477] [2020-01-16 18:33:15,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:15,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29614477] [2020-01-16 18:33:15,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:15,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:15,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097890538] [2020-01-16 18:33:15,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:15,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:15,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:15,651 INFO L87 Difference]: Start difference. First operand 802 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:33:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:15,786 INFO L93 Difference]: Finished difference Result 1457 states and 5021 transitions. [2020-01-16 18:33:15,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:15,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:15,790 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:33:15,790 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:33:15,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:33:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 776. [2020-01-16 18:33:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:33:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3105 transitions. [2020-01-16 18:33:15,812 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3105 transitions. Word has length 25 [2020-01-16 18:33:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:15,812 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3105 transitions. [2020-01-16 18:33:15,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3105 transitions. [2020-01-16 18:33:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:15,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:15,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:15,813 INFO L426 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -858812617, now seen corresponding path program 241 times [2020-01-16 18:33:15,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:15,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941734439] [2020-01-16 18:33:15,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941734439] [2020-01-16 18:33:16,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:16,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519651610] [2020-01-16 18:33:16,210 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:16,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:16,210 INFO L87 Difference]: Start difference. First operand 776 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:33:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:16,370 INFO L93 Difference]: Finished difference Result 1381 states and 4884 transitions. [2020-01-16 18:33:16,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:16,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:16,374 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:33:16,374 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:33:16,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:33:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 790. [2020-01-16 18:33:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-01-16 18:33:16,399 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-01-16 18:33:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:16,399 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-01-16 18:33:16,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-01-16 18:33:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:16,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:16,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] [2020-01-16 18:33:16,400 INFO L426 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 111438997, now seen corresponding path program 242 times [2020-01-16 18:33:16,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:16,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175459990] [2020-01-16 18:33:16,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175459990] [2020-01-16 18:33:16,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:16,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071383859] [2020-01-16 18:33:16,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:16,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:16,780 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:33:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:16,921 INFO L93 Difference]: Finished difference Result 1383 states and 4884 transitions. [2020-01-16 18:33:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:16,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:16,924 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:33:16,924 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:33:16,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:33:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 786. [2020-01-16 18:33:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-01-16 18:33:16,946 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:16,946 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-01-16 18:33:16,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-01-16 18:33:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:16,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:16,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:16,947 INFO L426 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1067221461, now seen corresponding path program 243 times [2020-01-16 18:33:16,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:16,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025365152] [2020-01-16 18:33:16,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:17,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025365152] [2020-01-16 18:33:17,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:17,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:17,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859929043] [2020-01-16 18:33:17,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:17,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:17,338 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:17,478 INFO L93 Difference]: Finished difference Result 1377 states and 4872 transitions. [2020-01-16 18:33:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:17,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:17,481 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:33:17,481 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:33:17,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:33:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-01-16 18:33:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:33:17,503 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:17,503 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:33:17,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:33:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:17,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:17,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:17,504 INFO L426 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2047976179, now seen corresponding path program 244 times [2020-01-16 18:33:17,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:17,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064847064] [2020-01-16 18:33:17,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:17,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064847064] [2020-01-16 18:33:17,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:17,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:17,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601868071] [2020-01-16 18:33:17,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:17,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:17,892 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:18,037 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-01-16 18:33:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:18,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:18,041 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:33:18,041 INFO L226 Difference]: Without dead ends: 1361 [2020-01-16 18:33:18,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-01-16 18:33:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 786. [2020-01-16 18:33:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-01-16 18:33:18,063 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-01-16 18:33:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:18,063 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-01-16 18:33:18,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-01-16 18:33:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:18,064 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:18,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:18,065 INFO L426 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash 450064183, now seen corresponding path program 245 times [2020-01-16 18:33:18,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:18,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279607102] [2020-01-16 18:33:18,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:18,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279607102] [2020-01-16 18:33:18,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:18,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:18,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193756247] [2020-01-16 18:33:18,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:18,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:18,452 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:33:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:18,592 INFO L93 Difference]: Finished difference Result 1381 states and 4877 transitions. [2020-01-16 18:33:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:18,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:18,596 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:33:18,596 INFO L226 Difference]: Without dead ends: 1366 [2020-01-16 18:33:18,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-01-16 18:33:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 789. [2020-01-16 18:33:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:33:18,617 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:33:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:18,618 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:33:18,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:33:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:18,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:18,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:18,619 INFO L426 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2061005141, now seen corresponding path program 246 times [2020-01-16 18:33:18,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:18,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164727625] [2020-01-16 18:33:18,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:19,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-01-16 18:33:19,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164727625] [2020-01-16 18:33:19,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:19,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:19,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170060876] [2020-01-16 18:33:19,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:19,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:19,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:19,009 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:33:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,144 INFO L93 Difference]: Finished difference Result 1378 states and 4868 transitions. [2020-01-16 18:33:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:19,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,148 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:33:19,148 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:33:19,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:33:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 783. [2020-01-16 18:33:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:33:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3138 transitions. [2020-01-16 18:33:19,170 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3138 transitions. Word has length 25 [2020-01-16 18:33:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,170 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3138 transitions. [2020-01-16 18:33:19,170 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3138 transitions. [2020-01-16 18:33:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:19,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:19,171 INFO L426 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1703784069, now seen corresponding path program 247 times [2020-01-16 18:33:19,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037734223] [2020-01-16 18:33:19,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:19,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037734223] [2020-01-16 18:33:19,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:19,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:19,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372700810] [2020-01-16 18:33:19,565 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:19,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:19,565 INFO L87 Difference]: Start difference. First operand 783 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:33:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,720 INFO L93 Difference]: Finished difference Result 1387 states and 4898 transitions. [2020-01-16 18:33:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:19,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,724 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:33:19,724 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:33:19,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:33:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-01-16 18:33:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-01-16 18:33:19,757 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-01-16 18:33:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,757 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-01-16 18:33:19,757 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-01-16 18:33:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:19,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:19,758 INFO L426 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash -733532455, now seen corresponding path program 248 times [2020-01-16 18:33:19,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452697515] [2020-01-16 18:33:19,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:20,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452697515] [2020-01-16 18:33:20,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:20,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338181850] [2020-01-16 18:33:20,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:20,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:20,142 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:33:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,274 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:33:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:20,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,278 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:33:20,278 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:33:20,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:33:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:33:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3149 transitions. [2020-01-16 18:33:20,299 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,300 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3149 transitions. [2020-01-16 18:33:20,300 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3149 transitions. [2020-01-16 18:33:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:20,301 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:20,302 INFO L426 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -220649131, now seen corresponding path program 249 times [2020-01-16 18:33:20,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438670279] [2020-01-16 18:33:20,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,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-01-16 18:33:20,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438670279] [2020-01-16 18:33:20,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:20,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616067821] [2020-01-16 18:33:20,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:20,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:20,695 INFO L87 Difference]: Start difference. First operand 787 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,833 INFO L93 Difference]: Finished difference Result 1386 states and 4892 transitions. [2020-01-16 18:33:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:20,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,838 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:33:20,838 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:33:20,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:33:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 791. [2020-01-16 18:33:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-01-16 18:33:20,865 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-01-16 18:33:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,866 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-01-16 18:33:20,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-01-16 18:33:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:20,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,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] [2020-01-16 18:33:20,867 INFO L426 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 781111795, now seen corresponding path program 250 times [2020-01-16 18:33:20,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773998938] [2020-01-16 18:33:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773998938] [2020-01-16 18:33:21,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128766796] [2020-01-16 18:33:21,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:21,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:21,259 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:33:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,404 INFO L93 Difference]: Finished difference Result 1387 states and 4890 transitions. [2020-01-16 18:33:21,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:21,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,409 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:33:21,409 INFO L226 Difference]: Without dead ends: 1369 [2020-01-16 18:33:21,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-01-16 18:33:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 787. [2020-01-16 18:33:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-01-16 18:33:21,430 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-01-16 18:33:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,431 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-01-16 18:33:21,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-01-16 18:33:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:21,432 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:21,432 INFO L426 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 256285179, now seen corresponding path program 251 times [2020-01-16 18:33:21,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43833487] [2020-01-16 18:33:21,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43833487] [2020-01-16 18:33:21,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:21,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173244095] [2020-01-16 18:33:21,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:21,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:21,826 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:33:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,955 INFO L93 Difference]: Finished difference Result 1391 states and 4899 transitions. [2020-01-16 18:33:21,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:21,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,958 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:33:21,958 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:33:21,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:33:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-01-16 18:33:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-01-16 18:33:21,980 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,980 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-01-16 18:33:21,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-01-16 18:33:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:21,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:21,982 INFO L426 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash 794140757, now seen corresponding path program 252 times [2020-01-16 18:33:21,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453746475] [2020-01-16 18:33:21,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:22,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453746475] [2020-01-16 18:33:22,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:22,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:22,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406453944] [2020-01-16 18:33:22,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:22,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:22,372 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:22,526 INFO L93 Difference]: Finished difference Result 1390 states and 4892 transitions. [2020-01-16 18:33:22,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:22,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:22,530 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:33:22,531 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:33:22,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:33:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-01-16 18:33:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:33:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3135 transitions. [2020-01-16 18:33:22,552 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3135 transitions. Word has length 25 [2020-01-16 18:33:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:22,552 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3135 transitions. [2020-01-16 18:33:22,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3135 transitions. [2020-01-16 18:33:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:22,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:22,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:22,553 INFO L426 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -200235717, now seen corresponding path program 253 times [2020-01-16 18:33:22,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:22,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362727787] [2020-01-16 18:33:22,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:22,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362727787] [2020-01-16 18:33:22,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:22,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:22,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709299130] [2020-01-16 18:33:22,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:22,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:22,960 INFO L87 Difference]: Start difference. First operand 783 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:33:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,101 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-01-16 18:33:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:23,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,105 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:33:23,105 INFO L226 Difference]: Without dead ends: 1363 [2020-01-16 18:33:23,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-01-16 18:33:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 789. [2020-01-16 18:33:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:33:23,131 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:33:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,131 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:33:23,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:33:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:23,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:23,133 INFO L426 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 780519001, now seen corresponding path program 254 times [2020-01-16 18:33:23,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043975260] [2020-01-16 18:33:23,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:23,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-01-16 18:33:23,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043975260] [2020-01-16 18:33:23,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:23,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:23,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132879784] [2020-01-16 18:33:23,535 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:23,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:23,535 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:33:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,682 INFO L93 Difference]: Finished difference Result 1375 states and 4862 transitions. [2020-01-16 18:33:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:23,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,686 INFO L225 Difference]: With dead ends: 1375 [2020-01-16 18:33:23,686 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:33:23,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:33:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-01-16 18:33:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3143 transitions. [2020-01-16 18:33:23,707 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3143 transitions. Word has length 25 [2020-01-16 18:33:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,707 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3143 transitions. [2020-01-16 18:33:23,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3143 transitions. [2020-01-16 18:33:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:23,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:23,709 INFO L426 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash -643134857, now seen corresponding path program 255 times [2020-01-16 18:33:23,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972985094] [2020-01-16 18:33:23,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972985094] [2020-01-16 18:33:24,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:24,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513999608] [2020-01-16 18:33:24,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:24,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:24,120 INFO L87 Difference]: Start difference. First operand 786 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:33:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:24,264 INFO L93 Difference]: Finished difference Result 1379 states and 4871 transitions. [2020-01-16 18:33:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:24,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:24,268 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:33:24,268 INFO L226 Difference]: Without dead ends: 1366 [2020-01-16 18:33:24,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-01-16 18:33:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 790. [2020-01-16 18:33:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:33:24,290 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:24,290 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:33:24,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:33:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:24,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:24,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:24,291 INFO L426 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 358626069, now seen corresponding path program 256 times [2020-01-16 18:33:24,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:24,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512958136] [2020-01-16 18:33:24,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,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-01-16 18:33:24,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512958136] [2020-01-16 18:33:24,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:24,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382924392] [2020-01-16 18:33:24,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:24,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:24,775 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:24,916 INFO L93 Difference]: Finished difference Result 1380 states and 4869 transitions. [2020-01-16 18:33:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:24,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:24,920 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:33:24,920 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:33:24,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:33:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 786. [2020-01-16 18:33:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-01-16 18:33:24,941 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-01-16 18:33:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:24,941 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-01-16 18:33:24,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-01-16 18:33:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:24,943 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:24,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:24,943 INFO L426 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1770336635, now seen corresponding path program 257 times [2020-01-16 18:33:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120427688] [2020-01-16 18:33:24,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:25,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120427688] [2020-01-16 18:33:25,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:25,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:25,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91844140] [2020-01-16 18:33:25,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:25,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:25,328 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:33:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:25,485 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-01-16 18:33:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:25,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:25,489 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:33:25,489 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:33:25,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:33:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-01-16 18:33:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-01-16 18:33:25,510 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-01-16 18:33:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:25,510 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-01-16 18:33:25,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-01-16 18:33:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:25,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:25,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:25,511 INFO L426 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 697251255, now seen corresponding path program 258 times [2020-01-16 18:33:25,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:25,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010398293] [2020-01-16 18:33:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:25,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-01-16 18:33:25,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010398293] [2020-01-16 18:33:25,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:25,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:25,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858797967] [2020-01-16 18:33:25,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:25,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:25,900 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:33:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,041 INFO L93 Difference]: Finished difference Result 1378 states and 4862 transitions. [2020-01-16 18:33:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:26,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,045 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:33:26,045 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:33:26,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:33:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 783. [2020-01-16 18:33:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:33:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-01-16 18:33:26,066 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-01-16 18:33:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,067 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-01-16 18:33:26,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-01-16 18:33:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:26,068 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:26,068 INFO L426 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1069639765, now seen corresponding path program 259 times [2020-01-16 18:33:26,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65333684] [2020-01-16 18:33:26,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65333684] [2020-01-16 18:33:26,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:26,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:26,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839565866] [2020-01-16 18:33:26,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:26,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:26,464 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:33:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,597 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-01-16 18:33:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:26,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,601 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:33:26,601 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:33:26,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:33:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 789. [2020-01-16 18:33:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:33:26,624 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:33:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,624 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:33:26,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:33:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:26,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:26,625 INFO L426 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1614386573, now seen corresponding path program 260 times [2020-01-16 18:33:26,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768270496] [2020-01-16 18:33:26,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:27,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768270496] [2020-01-16 18:33:27,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:27,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640016640] [2020-01-16 18:33:27,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:27,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:27,013 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:33:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,158 INFO L93 Difference]: Finished difference Result 1380 states and 4870 transitions. [2020-01-16 18:33:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:27,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,162 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:33:27,162 INFO L226 Difference]: Without dead ends: 1365 [2020-01-16 18:33:27,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-01-16 18:33:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 786. [2020-01-16 18:33:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-01-16 18:33:27,184 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-01-16 18:33:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,184 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-01-16 18:33:27,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-01-16 18:33:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:27,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:27,186 INFO L426 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2131235943, now seen corresponding path program 261 times [2020-01-16 18:33:27,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592530983] [2020-01-16 18:33:27,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,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-01-16 18:33:27,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592530983] [2020-01-16 18:33:27,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:27,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654719387] [2020-01-16 18:33:27,586 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:27,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:27,586 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:33:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,733 INFO L93 Difference]: Finished difference Result 1387 states and 4886 transitions. [2020-01-16 18:33:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:27,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,737 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:33:27,737 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:33:27,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:33:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:33:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-01-16 18:33:27,759 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,759 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-01-16 18:33:27,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-01-16 18:33:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:27,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:27,760 INFO L426 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1593380365, now seen corresponding path program 262 times [2020-01-16 18:33:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265788998] [2020-01-16 18:33:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:28,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-01-16 18:33:28,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265788998] [2020-01-16 18:33:28,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:28,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:28,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048973004] [2020-01-16 18:33:28,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:28,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:28,145 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:28,285 INFO L93 Difference]: Finished difference Result 1386 states and 4879 transitions. [2020-01-16 18:33:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:28,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:28,289 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:33:28,289 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:33:28,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:33:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 786. [2020-01-16 18:33:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:33:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-01-16 18:33:28,310 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-01-16 18:33:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:28,311 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-01-16 18:33:28,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-01-16 18:33:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:28,312 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:28,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:28,312 INFO L426 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2120732839, now seen corresponding path program 263 times [2020-01-16 18:33:28,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:28,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923201687] [2020-01-16 18:33:28,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:28,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923201687] [2020-01-16 18:33:28,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:28,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:28,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24881475] [2020-01-16 18:33:28,697 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:28,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:28,697 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:33:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:28,854 INFO L93 Difference]: Finished difference Result 1379 states and 4865 transitions. [2020-01-16 18:33:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:28,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:28,858 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:33:28,858 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:33:28,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:33:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 789. [2020-01-16 18:33:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-01-16 18:33:28,879 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-01-16 18:33:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:28,879 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-01-16 18:33:28,880 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-01-16 18:33:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:28,881 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:28,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:28,881 INFO L426 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1101149077, now seen corresponding path program 264 times [2020-01-16 18:33:28,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:28,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337245194] [2020-01-16 18:33:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:29,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-01-16 18:33:29,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337245194] [2020-01-16 18:33:29,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:29,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755608765] [2020-01-16 18:33:29,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:29,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:29,263 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:33:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,400 INFO L93 Difference]: Finished difference Result 1381 states and 4866 transitions. [2020-01-16 18:33:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:29,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,403 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:33:29,403 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:33:29,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:33:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 780. [2020-01-16 18:33:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:33:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3124 transitions. [2020-01-16 18:33:29,425 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3124 transitions. Word has length 25 [2020-01-16 18:33:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,425 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3124 transitions. [2020-01-16 18:33:29,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3124 transitions. [2020-01-16 18:33:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:29,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:29,426 INFO L426 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1070968235, now seen corresponding path program 265 times [2020-01-16 18:33:29,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:29,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76357438] [2020-01-16 18:33:29,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:29,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-01-16 18:33:29,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76357438] [2020-01-16 18:33:29,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:29,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185353333] [2020-01-16 18:33:29,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:29,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:29,806 INFO L87 Difference]: Start difference. First operand 780 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:33:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,972 INFO L93 Difference]: Finished difference Result 1393 states and 4910 transitions. [2020-01-16 18:33:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:29,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,976 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:33:29,976 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:33:29,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:33:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-01-16 18:33:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-01-16 18:33:29,998 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-01-16 18:33:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,998 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-01-16 18:33:29,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-01-16 18:33:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:29,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:29,999 INFO L426 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash -100716621, now seen corresponding path program 266 times [2020-01-16 18:33:30,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:30,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599213201] [2020-01-16 18:33:30,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:30,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599213201] [2020-01-16 18:33:30,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:30,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789032804] [2020-01-16 18:33:30,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:30,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:30,378 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:33:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:30,528 INFO L93 Difference]: Finished difference Result 1395 states and 4910 transitions. [2020-01-16 18:33:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:30,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:30,532 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:33:30,532 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:33:30,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:33:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-01-16 18:33:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3150 transitions. [2020-01-16 18:33:30,553 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:30,553 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3150 transitions. [2020-01-16 18:33:30,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3150 transitions. [2020-01-16 18:33:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:30,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:30,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:30,554 INFO L426 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 855065843, now seen corresponding path program 267 times [2020-01-16 18:33:30,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:30,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977184360] [2020-01-16 18:33:30,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:30,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977184360] [2020-01-16 18:33:30,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:30,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37886459] [2020-01-16 18:33:30,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:30,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:30,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:30,956 INFO L87 Difference]: Start difference. First operand 787 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,115 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:33:31,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:31,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,119 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:33:31,119 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:33:31,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:33:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-01-16 18:33:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:33:31,141 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:33:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,141 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:33:31,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:33:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:31,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:31,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:31,142 INFO L426 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1835820561, now seen corresponding path program 268 times [2020-01-16 18:33:31,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892791921] [2020-01-16 18:33:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:31,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892791921] [2020-01-16 18:33:31,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:31,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165127676] [2020-01-16 18:33:31,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:31,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:31,544 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:33:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,687 INFO L93 Difference]: Finished difference Result 1388 states and 4893 transitions. [2020-01-16 18:33:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:31,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,690 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:33:31,691 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:33:31,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:33:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:33:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:33:31,712 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:33:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,712 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:33:31,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:33:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:31,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:31,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:31,713 INFO L426 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 237908565, now seen corresponding path program 269 times [2020-01-16 18:33:31,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042285817] [2020-01-16 18:33:31,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042285817] [2020-01-16 18:33:32,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902095946] [2020-01-16 18:33:32,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:32,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:32,100 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:33:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,249 INFO L93 Difference]: Finished difference Result 1393 states and 4903 transitions. [2020-01-16 18:33:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:32,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,253 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:33:32,253 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:33:32,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:33:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 790. [2020-01-16 18:33:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-01-16 18:33:32,275 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-01-16 18:33:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,275 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-01-16 18:33:32,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-01-16 18:33:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:32,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:32,276 INFO L426 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849523, now seen corresponding path program 270 times [2020-01-16 18:33:32,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327679955] [2020-01-16 18:33:32,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:32,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327679955] [2020-01-16 18:33:32,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:32,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026251739] [2020-01-16 18:33:32,659 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:32,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:32,659 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:33:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,828 INFO L93 Difference]: Finished difference Result 1390 states and 4894 transitions. [2020-01-16 18:33:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:32,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,832 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:33:32,832 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:33:32,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:33:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 784. [2020-01-16 18:33:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:33:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3139 transitions. [2020-01-16 18:33:32,854 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3139 transitions. Word has length 25 [2020-01-16 18:33:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,855 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3139 transitions. [2020-01-16 18:33:32,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3139 transitions. [2020-01-16 18:33:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:32,856 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,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] [2020-01-16 18:33:32,856 INFO L426 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1956541883, now seen corresponding path program 271 times [2020-01-16 18:33:32,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785876781] [2020-01-16 18:33:32,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785876781] [2020-01-16 18:33:33,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:33,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332521769] [2020-01-16 18:33:33,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:33,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:33,234 INFO L87 Difference]: Start difference. First operand 784 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:33:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:33,366 INFO L93 Difference]: Finished difference Result 1407 states and 4941 transitions. [2020-01-16 18:33:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:33,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:33,370 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:33:33,370 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:33:33,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:33:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 793. [2020-01-16 18:33:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-01-16 18:33:33,392 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-01-16 18:33:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:33,392 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-01-16 18:33:33,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-01-16 18:33:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:33,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:33,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:33,393 INFO L426 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173799, now seen corresponding path program 272 times [2020-01-16 18:33:33,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:33,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102210776] [2020-01-16 18:33:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102210776] [2020-01-16 18:33:33,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:33,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114234950] [2020-01-16 18:33:33,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:33,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:33,769 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:33:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:33,922 INFO L93 Difference]: Finished difference Result 1409 states and 4941 transitions. [2020-01-16 18:33:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:33,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:33,926 INFO L225 Difference]: With dead ends: 1409 [2020-01-16 18:33:33,926 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:33:33,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:33:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:33:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3153 transitions. [2020-01-16 18:33:33,947 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3153 transitions. Word has length 25 [2020-01-16 18:33:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:33,948 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3153 transitions. [2020-01-16 18:33:33,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3153 transitions. [2020-01-16 18:33:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:33,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:33,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:33,949 INFO L426 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1070743603, now seen corresponding path program 273 times [2020-01-16 18:33:33,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:33,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590825039] [2020-01-16 18:33:33,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:34,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-01-16 18:33:34,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590825039] [2020-01-16 18:33:34,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:34,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:34,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811679991] [2020-01-16 18:33:34,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:34,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:34,330 INFO L87 Difference]: Start difference. First operand 789 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:33:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:34,524 INFO L93 Difference]: Finished difference Result 1411 states and 4944 transitions. [2020-01-16 18:33:34,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:34,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:34,528 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:33:34,529 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:33:34,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:33:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:33:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:33:34,550 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:33:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:34,550 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:33:34,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:33:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:34,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:34,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:34,552 INFO L426 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2083007633, now seen corresponding path program 274 times [2020-01-16 18:33:34,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:34,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539152464] [2020-01-16 18:33:34,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:34,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539152464] [2020-01-16 18:33:34,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:34,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:34,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102864127] [2020-01-16 18:33:34,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:34,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:34,963 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:33:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,116 INFO L93 Difference]: Finished difference Result 1416 states and 4949 transitions. [2020-01-16 18:33:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:35,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,120 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:33:35,120 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:33:35,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:33:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:33:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:33:35,142 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:33:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,142 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:33:35,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:33:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:35,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,143 INFO L426 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -52759941, now seen corresponding path program 275 times [2020-01-16 18:33:35,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042255723] [2020-01-16 18:33:35,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:35,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-01-16 18:33:35,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042255723] [2020-01-16 18:33:35,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:35,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:35,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226791819] [2020-01-16 18:33:35,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:35,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:35,539 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:33:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,686 INFO L93 Difference]: Finished difference Result 1417 states and 4953 transitions. [2020-01-16 18:33:35,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:35,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,690 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:33:35,690 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:33:35,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:33:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 796. [2020-01-16 18:33:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3161 transitions. [2020-01-16 18:33:35,713 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,713 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3161 transitions. [2020-01-16 18:33:35,713 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3161 transitions. [2020-01-16 18:33:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:35,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,714 INFO L426 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2096036595, now seen corresponding path program 276 times [2020-01-16 18:33:35,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535977014] [2020-01-16 18:33:35,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:36,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535977014] [2020-01-16 18:33:36,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:36,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:36,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505180840] [2020-01-16 18:33:36,108 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:36,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:36,109 INFO L87 Difference]: Start difference. First operand 796 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:36,232 INFO L93 Difference]: Finished difference Result 1420 states and 4952 transitions. [2020-01-16 18:33:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:36,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:36,235 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:33:36,235 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:33:36,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:33:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 784. [2020-01-16 18:33:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:33:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3135 transitions. [2020-01-16 18:33:36,258 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3135 transitions. Word has length 25 [2020-01-16 18:33:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:36,258 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3135 transitions. [2020-01-16 18:33:36,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3135 transitions. [2020-01-16 18:33:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:36,260 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:36,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:36,260 INFO L426 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -834877061, now seen corresponding path program 277 times [2020-01-16 18:33:36,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:36,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521172554] [2020-01-16 18:33:36,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:36,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521172554] [2020-01-16 18:33:36,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:36,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:36,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272815070] [2020-01-16 18:33:36,650 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:36,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:36,650 INFO L87 Difference]: Start difference. First operand 784 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:33:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:36,812 INFO L93 Difference]: Finished difference Result 1395 states and 4906 transitions. [2020-01-16 18:33:36,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:36,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:36,816 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:33:36,816 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:33:36,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:33:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 791. [2020-01-16 18:33:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-01-16 18:33:36,838 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:36,839 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-01-16 18:33:36,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-01-16 18:33:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:36,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:36,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:36,840 INFO L426 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash 145877657, now seen corresponding path program 278 times [2020-01-16 18:33:36,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:36,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111631157] [2020-01-16 18:33:36,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111631157] [2020-01-16 18:33:37,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:37,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543299492] [2020-01-16 18:33:37,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:37,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:37,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:37,215 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:37,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,390 INFO L93 Difference]: Finished difference Result 1394 states and 4901 transitions. [2020-01-16 18:33:37,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:37,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,394 INFO L225 Difference]: With dead ends: 1394 [2020-01-16 18:33:37,394 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:33:37,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:33:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 788. [2020-01-16 18:33:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:33:37,416 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:33:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:37,416 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:33:37,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:33:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:37,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:37,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:37,417 INFO L426 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash 648257877, now seen corresponding path program 279 times [2020-01-16 18:33:37,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:37,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8219702] [2020-01-16 18:33:37,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8219702] [2020-01-16 18:33:37,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:37,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111014271] [2020-01-16 18:33:37,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:37,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:37,803 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:33:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,955 INFO L93 Difference]: Finished difference Result 1403 states and 4919 transitions. [2020-01-16 18:33:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:37,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,959 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:33:37,959 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:33:37,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:33:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 793. [2020-01-16 18:33:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-01-16 18:33:37,980 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-01-16 18:33:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:37,980 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-01-16 18:33:37,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-01-16 18:33:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:37,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:37,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:37,982 INFO L426 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1660521907, now seen corresponding path program 280 times [2020-01-16 18:33:37,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:37,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762705649] [2020-01-16 18:33:37,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:38,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-01-16 18:33:38,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762705649] [2020-01-16 18:33:38,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:38,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:38,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110472262] [2020-01-16 18:33:38,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:38,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:38,376 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:33:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:38,516 INFO L93 Difference]: Finished difference Result 1408 states and 4924 transitions. [2020-01-16 18:33:38,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:38,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:38,521 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:33:38,521 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:33:38,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:33:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:33:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:33:38,542 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:33:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:38,543 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:33:38,543 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:33:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:38,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:38,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:38,544 INFO L426 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1461291515, now seen corresponding path program 281 times [2020-01-16 18:33:38,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:38,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264642797] [2020-01-16 18:33:38,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:38,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264642797] [2020-01-16 18:33:38,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:38,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:38,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685369800] [2020-01-16 18:33:38,928 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:38,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:38,928 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:33:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:39,096 INFO L93 Difference]: Finished difference Result 1400 states and 4908 transitions. [2020-01-16 18:33:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:39,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:39,100 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:33:39,100 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:33:39,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:33:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:33:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:33:39,121 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:39,121 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:33:39,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:33:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:39,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:39,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:39,123 INFO L426 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1999147093, now seen corresponding path program 282 times [2020-01-16 18:33:39,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:39,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792165283] [2020-01-16 18:33:39,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:39,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792165283] [2020-01-16 18:33:39,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:39,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:39,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751426853] [2020-01-16 18:33:39,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:39,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:39,523 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:39,642 INFO L93 Difference]: Finished difference Result 1406 states and 4916 transitions. [2020-01-16 18:33:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:39,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:39,646 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:33:39,646 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:33:39,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:33:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-01-16 18:33:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:33:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-01-16 18:33:39,668 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-01-16 18:33:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:39,669 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-01-16 18:33:39,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-01-16 18:33:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:39,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:39,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:39,670 INFO L426 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1933934797, now seen corresponding path program 283 times [2020-01-16 18:33:39,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:39,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776267847] [2020-01-16 18:33:39,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776267847] [2020-01-16 18:33:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:40,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446671880] [2020-01-16 18:33:40,050 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:40,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:40,051 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:33:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,211 INFO L93 Difference]: Finished difference Result 1403 states and 4920 transitions. [2020-01-16 18:33:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:40,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,214 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:33:40,214 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:33:40,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:33:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 791. [2020-01-16 18:33:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:33:40,236 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,236 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:33:40,236 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:33:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:40,237 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:40,237 INFO L426 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -322993839, now seen corresponding path program 284 times [2020-01-16 18:33:40,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910918565] [2020-01-16 18:33:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:40,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910918565] [2020-01-16 18:33:40,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:40,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:40,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422556864] [2020-01-16 18:33:40,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:40,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:40,620 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,774 INFO L93 Difference]: Finished difference Result 1400 states and 4911 transitions. [2020-01-16 18:33:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:40,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,778 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:33:40,778 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:33:40,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:33:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:33:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:33:40,799 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:33:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,799 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:33:40,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:33:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:40,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:40,801 INFO L426 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1854686233, now seen corresponding path program 285 times [2020-01-16 18:33:40,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776484151] [2020-01-16 18:33:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:41,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-01-16 18:33:41,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776484151] [2020-01-16 18:33:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651120617] [2020-01-16 18:33:41,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:41,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:41,187 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:33:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:41,335 INFO L93 Difference]: Finished difference Result 1413 states and 4939 transitions. [2020-01-16 18:33:41,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:41,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:41,339 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:33:41,339 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:33:41,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:33:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2020-01-16 18:33:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:33:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:33:41,361 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:33:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:41,361 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:33:41,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:33:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:41,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:41,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:41,362 INFO L426 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash -291484527, now seen corresponding path program 286 times [2020-01-16 18:33:41,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:41,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826874402] [2020-01-16 18:33:41,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:41,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826874402] [2020-01-16 18:33:41,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:41,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:41,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145440291] [2020-01-16 18:33:41,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:41,756 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:33:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:41,861 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-01-16 18:33:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:41,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:41,865 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:33:41,865 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:33:41,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:33:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 788. [2020-01-16 18:33:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:33:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:33:41,886 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:33:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:41,886 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:33:41,886 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:33:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:41,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:41,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] [2020-01-16 18:33:41,888 INFO L426 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1865189337, now seen corresponding path program 287 times [2020-01-16 18:33:41,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:41,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971763226] [2020-01-16 18:33:41,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:42,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971763226] [2020-01-16 18:33:42,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:42,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077483861] [2020-01-16 18:33:42,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:42,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:42,277 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:33:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:42,463 INFO L93 Difference]: Finished difference Result 1404 states and 4914 transitions. [2020-01-16 18:33:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:42,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:42,467 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:33:42,468 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:33:42,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:33:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 792. [2020-01-16 18:33:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:33:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:33:42,494 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:33:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:42,495 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:33:42,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:33:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:42,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:42,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:42,496 INFO L426 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922381, now seen corresponding path program 288 times [2020-01-16 18:33:42,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:42,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464393975] [2020-01-16 18:33:42,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:42,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464393975] [2020-01-16 18:33:42,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:42,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419168682] [2020-01-16 18:33:42,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:42,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:42,905 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:33:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,048 INFO L93 Difference]: Finished difference Result 1410 states and 4922 transitions. [2020-01-16 18:33:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:43,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,052 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:33:43,052 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:33:43,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:33:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 780. [2020-01-16 18:33:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:33:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3120 transitions. [2020-01-16 18:33:43,074 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3120 transitions. Word has length 25 [2020-01-16 18:33:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,074 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3120 transitions. [2020-01-16 18:33:43,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3120 transitions. [2020-01-16 18:33:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:43,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:43,076 INFO L426 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1954716373, now seen corresponding path program 289 times [2020-01-16 18:33:43,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125299472] [2020-01-16 18:33:43,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:43,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125299472] [2020-01-16 18:33:43,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:43,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:43,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431517273] [2020-01-16 18:33:43,478 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:43,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:43,478 INFO L87 Difference]: Start difference. First operand 780 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:33:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,644 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-01-16 18:33:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:43,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,648 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:33:43,648 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:33:43,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:33:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:33:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:33:43,669 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:33:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,669 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:33:43,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:33:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:43,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:43,671 INFO L426 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1369999309, now seen corresponding path program 290 times [2020-01-16 18:33:43,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135738035] [2020-01-16 18:33:43,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135738035] [2020-01-16 18:33:44,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:44,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072866353] [2020-01-16 18:33:44,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:44,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:44,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:44,054 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:33:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:44,229 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-01-16 18:33:44,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:44,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:44,233 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:33:44,233 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:33:44,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:33:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:33:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:33:44,254 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:44,254 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:33:44,254 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:33:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:44,255 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:44,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:44,255 INFO L426 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -857115985, now seen corresponding path program 291 times [2020-01-16 18:33:44,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:44,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816268172] [2020-01-16 18:33:44,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816268172] [2020-01-16 18:33:44,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:44,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069774115] [2020-01-16 18:33:44,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:44,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:44,640 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:44,804 INFO L93 Difference]: Finished difference Result 1410 states and 4957 transitions. [2020-01-16 18:33:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:44,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:44,807 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:33:44,808 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:33:44,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:33:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 793. [2020-01-16 18:33:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:33:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:33:44,829 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:44,829 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:33:44,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:33:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:44,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:44,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:44,830 INFO L426 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 144644941, now seen corresponding path program 292 times [2020-01-16 18:33:44,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:44,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026565366] [2020-01-16 18:33:44,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:45,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026565366] [2020-01-16 18:33:45,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:45,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:45,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680430262] [2020-01-16 18:33:45,221 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:45,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:45,222 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,388 INFO L93 Difference]: Finished difference Result 1411 states and 4955 transitions. [2020-01-16 18:33:45,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:45,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,393 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:33:45,393 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:33:45,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:33:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:33:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:33:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-01-16 18:33:45,415 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,415 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-01-16 18:33:45,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-01-16 18:33:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:45,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:45,416 INFO L426 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash -380181675, now seen corresponding path program 293 times [2020-01-16 18:33:45,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114891381] [2020-01-16 18:33:45,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:45,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-01-16 18:33:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114891381] [2020-01-16 18:33:45,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:45,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762633038] [2020-01-16 18:33:45,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:45,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:45,802 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,935 INFO L93 Difference]: Finished difference Result 1415 states and 4964 transitions. [2020-01-16 18:33:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:45,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,938 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:33:45,939 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:33:45,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:33:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 794. [2020-01-16 18:33:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-01-16 18:33:45,960 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-01-16 18:33:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,960 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-01-16 18:33:45,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-01-16 18:33:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:45,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:45,961 INFO L426 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash 157673903, now seen corresponding path program 294 times [2020-01-16 18:33:45,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571145195] [2020-01-16 18:33:45,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571145195] [2020-01-16 18:33:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:46,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172891228] [2020-01-16 18:33:46,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:46,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:46,355 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:33:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:46,522 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-01-16 18:33:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:46,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:46,526 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:33:46,526 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:33:46,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:33:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 785. [2020-01-16 18:33:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:33:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3139 transitions. [2020-01-16 18:33:46,547 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3139 transitions. Word has length 25 [2020-01-16 18:33:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:46,547 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3139 transitions. [2020-01-16 18:33:46,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3139 transitions. [2020-01-16 18:33:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:46,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:46,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:46,548 INFO L426 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1532230647, now seen corresponding path program 295 times [2020-01-16 18:33:46,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:46,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137289067] [2020-01-16 18:33:46,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:46,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137289067] [2020-01-16 18:33:46,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414390450] [2020-01-16 18:33:46,926 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:46,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:46,926 INFO L87 Difference]: Start difference. First operand 785 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:33:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,105 INFO L93 Difference]: Finished difference Result 1419 states and 4976 transitions. [2020-01-16 18:33:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:47,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,109 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:33:47,109 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:33:47,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:33:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:33:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:33:47,130 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:33:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,131 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:33:47,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:33:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:47,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:47,132 INFO L426 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1792485035, now seen corresponding path program 296 times [2020-01-16 18:33:47,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516445934] [2020-01-16 18:33:47,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:47,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516445934] [2020-01-16 18:33:47,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:47,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:47,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681807468] [2020-01-16 18:33:47,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:47,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:47,515 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:33:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,666 INFO L93 Difference]: Finished difference Result 1421 states and 4976 transitions. [2020-01-16 18:33:47,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:47,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,670 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:33:47,671 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:33:47,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:33:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:33:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-01-16 18:33:47,692 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-01-16 18:33:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,692 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-01-16 18:33:47,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-01-16 18:33:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:47,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:47,693 INFO L426 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash 646432367, now seen corresponding path program 297 times [2020-01-16 18:33:47,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657733345] [2020-01-16 18:33:47,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657733345] [2020-01-16 18:33:48,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:48,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994276774] [2020-01-16 18:33:48,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:48,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:48,082 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:33:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:48,243 INFO L93 Difference]: Finished difference Result 1423 states and 4979 transitions. [2020-01-16 18:33:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:48,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:48,247 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:33:48,247 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:33:48,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:33:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 795. [2020-01-16 18:33:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:33:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3162 transitions. [2020-01-16 18:33:48,269 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3162 transitions. Word has length 25 [2020-01-16 18:33:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:48,270 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3162 transitions. [2020-01-16 18:33:48,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3162 transitions. [2020-01-16 18:33:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:48,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:48,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:48,271 INFO L426 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1658696397, now seen corresponding path program 298 times [2020-01-16 18:33:48,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:48,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920803310] [2020-01-16 18:33:48,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920803310] [2020-01-16 18:33:48,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:48,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321589350] [2020-01-16 18:33:48,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:48,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:48,670 INFO L87 Difference]: Start difference. First operand 795 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:33:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:48,805 INFO L93 Difference]: Finished difference Result 1428 states and 4984 transitions. [2020-01-16 18:33:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:48,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:48,808 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:33:48,808 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:33:48,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:33:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 790. [2020-01-16 18:33:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:33:48,832 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:33:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:48,833 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:33:48,833 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:33:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:48,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:48,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:48,834 INFO L426 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:48,834 INFO L82 PathProgramCache]: Analyzing trace with hash -477071177, now seen corresponding path program 299 times [2020-01-16 18:33:48,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:48,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436567040] [2020-01-16 18:33:48,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:49,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436567040] [2020-01-16 18:33:49,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:49,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:49,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86590235] [2020-01-16 18:33:49,220 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:49,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:49,220 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:33:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,371 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:33:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:49,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,375 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:33:49,376 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:33:49,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:33:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 797. [2020-01-16 18:33:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:33:49,398 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:33:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,398 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:33:49,398 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:33:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:49,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:49,399 INFO L426 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1671725359, now seen corresponding path program 300 times [2020-01-16 18:33:49,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312367943] [2020-01-16 18:33:49,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:49,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312367943] [2020-01-16 18:33:49,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:49,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:49,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582272799] [2020-01-16 18:33:49,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:49,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:49,788 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:33:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,910 INFO L93 Difference]: Finished difference Result 1432 states and 4987 transitions. [2020-01-16 18:33:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:49,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,913 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:33:49,914 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:33:49,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:33:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 785. [2020-01-16 18:33:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:33:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3134 transitions. [2020-01-16 18:33:49,935 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3134 transitions. Word has length 25 [2020-01-16 18:33:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,935 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3134 transitions. [2020-01-16 18:33:49,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3134 transitions. [2020-01-16 18:33:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:49,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:49,936 INFO L426 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1747908407, now seen corresponding path program 301 times [2020-01-16 18:33:49,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773877601] [2020-01-16 18:33:49,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:50,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773877601] [2020-01-16 18:33:50,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:50,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671243980] [2020-01-16 18:33:50,324 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:50,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:50,325 INFO L87 Difference]: Start difference. First operand 785 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:33:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:50,488 INFO L93 Difference]: Finished difference Result 1416 states and 4964 transitions. [2020-01-16 18:33:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:50,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:50,492 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:33:50,492 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:33:50,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:33:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 794. [2020-01-16 18:33:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:33:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-01-16 18:33:50,514 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-01-16 18:33:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:50,515 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-01-16 18:33:50,515 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-01-16 18:33:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:50,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:50,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:50,516 INFO L426 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1545297963, now seen corresponding path program 302 times [2020-01-16 18:33:50,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:50,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316490766] [2020-01-16 18:33:50,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,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-01-16 18:33:50,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316490766] [2020-01-16 18:33:50,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:50,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911832122] [2020-01-16 18:33:50,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:50,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:50,900 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:33:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,046 INFO L93 Difference]: Finished difference Result 1417 states and 4962 transitions. [2020-01-16 18:33:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:51,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,050 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:33:51,050 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:33:51,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:33:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:33:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:33:51,072 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:33:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,072 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:33:51,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:33:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:51,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:51,074 INFO L426 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -621024811, now seen corresponding path program 303 times [2020-01-16 18:33:51,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791414599] [2020-01-16 18:33:51,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791414599] [2020-01-16 18:33:51,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:51,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441995122] [2020-01-16 18:33:51,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:51,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:51,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:51,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:51,451 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:33:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,584 INFO L93 Difference]: Finished difference Result 1421 states and 4969 transitions. [2020-01-16 18:33:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:51,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,588 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:33:51,588 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:33:51,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:33:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-01-16 18:33:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:33:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-01-16 18:33:51,610 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-01-16 18:33:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,610 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-01-16 18:33:51,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-01-16 18:33:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:51,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:51,611 INFO L426 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash 391239219, now seen corresponding path program 304 times [2020-01-16 18:33:51,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815115374] [2020-01-16 18:33:51,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815115374] [2020-01-16 18:33:51,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:52,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968401104] [2020-01-16 18:33:52,000 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:52,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:52,000 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:33:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:52,121 INFO L93 Difference]: Finished difference Result 1426 states and 4974 transitions. [2020-01-16 18:33:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:52,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:52,125 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:33:52,126 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:33:52,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:33:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:33:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-01-16 18:33:52,147 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-01-16 18:33:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:52,147 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-01-16 18:33:52,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-01-16 18:33:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:52,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:52,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:52,149 INFO L426 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -229884105, now seen corresponding path program 305 times [2020-01-16 18:33:52,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:52,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660476696] [2020-01-16 18:33:52,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:52,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660476696] [2020-01-16 18:33:52,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:52,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:52,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992375522] [2020-01-16 18:33:52,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:52,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:52,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:52,531 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:33:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:52,721 INFO L93 Difference]: Finished difference Result 1424 states and 4971 transitions. [2020-01-16 18:33:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:52,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:52,725 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:33:52,725 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:33:52,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:33:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 796. [2020-01-16 18:33:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-01-16 18:33:52,746 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-01-16 18:33:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:52,747 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-01-16 18:33:52,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-01-16 18:33:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:52,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:52,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:52,748 INFO L426 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1381056853, now seen corresponding path program 306 times [2020-01-16 18:33:52,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:52,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351324106] [2020-01-16 18:33:52,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:53,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351324106] [2020-01-16 18:33:53,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:53,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:53,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888880523] [2020-01-16 18:33:53,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:53,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:53,140 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:33:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,282 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:33:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:53,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,286 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:33:53,286 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:33:53,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:33:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 785. [2020-01-16 18:33:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:33:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-01-16 18:33:53,307 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-01-16 18:33:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,308 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-01-16 18:33:53,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-01-16 18:33:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:53,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:53,309 INFO L426 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1742942259, now seen corresponding path program 307 times [2020-01-16 18:33:53,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102492131] [2020-01-16 18:33:53,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:53,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102492131] [2020-01-16 18:33:53,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:53,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:53,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276073804] [2020-01-16 18:33:53,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:53,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:53,700 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:33:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,838 INFO L93 Difference]: Finished difference Result 1427 states and 4987 transitions. [2020-01-16 18:33:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:53,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,841 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:33:53,841 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:33:53,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:33:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 796. [2020-01-16 18:33:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:33:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3160 transitions. [2020-01-16 18:33:53,867 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3160 transitions. Word has length 25 [2020-01-16 18:33:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,868 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3160 transitions. [2020-01-16 18:33:53,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3160 transitions. [2020-01-16 18:33:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:53,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:53,869 INFO L426 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2014169459, now seen corresponding path program 308 times [2020-01-16 18:33:53,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797806584] [2020-01-16 18:33:53,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:54,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797806584] [2020-01-16 18:33:54,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:54,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20515123] [2020-01-16 18:33:54,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:54,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:54,257 INFO L87 Difference]: Start difference. First operand 796 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:33:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:54,441 INFO L93 Difference]: Finished difference Result 1426 states and 4980 transitions. [2020-01-16 18:33:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:54,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:54,445 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:33:54,445 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:33:54,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:33:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 791. [2020-01-16 18:33:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:33:54,466 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:33:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:54,466 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:33:54,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:33:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:54,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:54,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:54,467 INFO L426 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 142504405, now seen corresponding path program 309 times [2020-01-16 18:33:54,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:54,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732321507] [2020-01-16 18:33:54,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:54,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732321507] [2020-01-16 18:33:54,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:54,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906438917] [2020-01-16 18:33:54,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:54,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:54,864 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:33:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,047 INFO L93 Difference]: Finished difference Result 1433 states and 4994 transitions. [2020-01-16 18:33:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:55,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:55,051 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:33:55,051 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:33:55,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:33:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 798. [2020-01-16 18:33:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:33:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3159 transitions. [2020-01-16 18:33:55,072 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3159 transitions. Word has length 25 [2020-01-16 18:33:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:55,073 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3159 transitions. [2020-01-16 18:33:55,073 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3159 transitions. [2020-01-16 18:33:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:55,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:55,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:55,074 INFO L426 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2003666355, now seen corresponding path program 310 times [2020-01-16 18:33:55,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:55,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402948234] [2020-01-16 18:33:55,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:55,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-01-16 18:33:55,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402948234] [2020-01-16 18:33:55,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:55,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:55,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244475197] [2020-01-16 18:33:55,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:55,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:55,473 INFO L87 Difference]: Start difference. First operand 798 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:33:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,635 INFO L93 Difference]: Finished difference Result 1436 states and 4993 transitions. [2020-01-16 18:33:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:55,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:55,639 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:33:55,639 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:33:55,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:33:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-01-16 18:33:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-01-16 18:33:55,660 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-01-16 18:33:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:55,660 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-01-16 18:33:55,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-01-16 18:33:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:55,661 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:55,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:55,662 INFO L426 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:55,662 INFO L82 PathProgramCache]: Analyzing trace with hash 174013717, now seen corresponding path program 311 times [2020-01-16 18:33:55,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:55,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662199030] [2020-01-16 18:33:55,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:56,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662199030] [2020-01-16 18:33:56,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:56,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475097993] [2020-01-16 18:33:56,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:56,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:56,055 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:33:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:56,243 INFO L93 Difference]: Finished difference Result 1430 states and 4981 transitions. [2020-01-16 18:33:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:56,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,247 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:33:56,247 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:33:56,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:33:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-01-16 18:33:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:33:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3151 transitions. [2020-01-16 18:33:56,269 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3151 transitions. Word has length 25 [2020-01-16 18:33:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,269 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3151 transitions. [2020-01-16 18:33:56,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3151 transitions. [2020-01-16 18:33:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:56,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:56,270 INFO L426 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1784954675, now seen corresponding path program 312 times [2020-01-16 18:33:56,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645000285] [2020-01-16 18:33:56,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,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-01-16 18:33:56,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645000285] [2020-01-16 18:33:56,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:56,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368721712] [2020-01-16 18:33:56,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:56,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:56,661 INFO L87 Difference]: Start difference. First operand 797 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:33:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:56,824 INFO L93 Difference]: Finished difference Result 1434 states and 4983 transitions. [2020-01-16 18:33:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:56,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,828 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:33:56,828 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:33:56,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:33:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 780. [2020-01-16 18:33:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:33:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3116 transitions. [2020-01-16 18:33:56,849 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3116 transitions. Word has length 25 [2020-01-16 18:33:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,850 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3116 transitions. [2020-01-16 18:33:56,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3116 transitions. [2020-01-16 18:33:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:56,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:56,851 INFO L426 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1048858189, now seen corresponding path program 313 times [2020-01-16 18:33:56,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913491252] [2020-01-16 18:33:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:57,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913491252] [2020-01-16 18:33:57,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794059164] [2020-01-16 18:33:57,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:57,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:57,241 INFO L87 Difference]: Start difference. First operand 780 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:33:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:57,422 INFO L93 Difference]: Finished difference Result 1386 states and 4886 transitions. [2020-01-16 18:33:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:57,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:57,426 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:33:57,426 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:33:57,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:33:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 790. [2020-01-16 18:33:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:33:57,448 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:33:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:57,448 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:33:57,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:33:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:57,449 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:57,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:57,449 INFO L426 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -68103471, now seen corresponding path program 314 times [2020-01-16 18:33:57,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:57,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750350181] [2020-01-16 18:33:57,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:57,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750350181] [2020-01-16 18:33:57,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:57,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459182632] [2020-01-16 18:33:57,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:57,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:57,838 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:33:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,020 INFO L93 Difference]: Finished difference Result 1385 states and 4881 transitions. [2020-01-16 18:33:58,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:58,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,024 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:33:58,024 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:33:58,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:33:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:33:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3142 transitions. [2020-01-16 18:33:58,046 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3142 transitions. Word has length 25 [2020-01-16 18:33:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,046 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3142 transitions. [2020-01-16 18:33:58,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3142 transitions. [2020-01-16 18:33:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:58,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:58,047 INFO L426 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:58,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1491757329, now seen corresponding path program 315 times [2020-01-16 18:33:58,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363419582] [2020-01-16 18:33:58,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:58,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363419582] [2020-01-16 18:33:58,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:58,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:58,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028087613] [2020-01-16 18:33:58,437 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:58,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:58,437 INFO L87 Difference]: Start difference. First operand 787 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:33:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,578 INFO L93 Difference]: Finished difference Result 1389 states and 4890 transitions. [2020-01-16 18:33:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:58,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,582 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:33:58,582 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:33:58,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:33:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-01-16 18:33:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:33:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-01-16 18:33:58,605 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-01-16 18:33:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,605 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-01-16 18:33:58,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-01-16 18:33:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:58,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:58,606 INFO L426 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash -489996403, now seen corresponding path program 316 times [2020-01-16 18:33:58,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585954754] [2020-01-16 18:33:58,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:59,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585954754] [2020-01-16 18:33:59,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:59,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127995883] [2020-01-16 18:33:59,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:59,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:59,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:59,002 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:33:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,199 INFO L93 Difference]: Finished difference Result 1390 states and 4888 transitions. [2020-01-16 18:33:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:59,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,203 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:33:59,203 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:33:59,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:33:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-01-16 18:33:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:33:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3139 transitions. [2020-01-16 18:33:59,224 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3139 transitions. Word has length 25 [2020-01-16 18:33:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,224 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3139 transitions. [2020-01-16 18:33:59,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3139 transitions. [2020-01-16 18:33:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:59,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:59,226 INFO L426 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash 921714163, now seen corresponding path program 317 times [2020-01-16 18:33:59,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052768206] [2020-01-16 18:33:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:59,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052768206] [2020-01-16 18:33:59,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:33:59,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004854809] [2020-01-16 18:33:59,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:33:59,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:33:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:33:59,606 INFO L87 Difference]: Start difference. First operand 787 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:33:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,786 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-01-16 18:33:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:33:59,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:33:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,790 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:33:59,790 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:33:59,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:33:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:33:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-01-16 18:33:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:33:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3144 transitions. [2020-01-16 18:33:59,811 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3144 transitions. Word has length 25 [2020-01-16 18:33:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,811 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3144 transitions. [2020-01-16 18:33:59,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:33:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3144 transitions. [2020-01-16 18:33:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:33:59,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:59,812 INFO L426 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:33:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash -151371217, now seen corresponding path program 318 times [2020-01-16 18:33:59,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689052373] [2020-01-16 18:33:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689052373] [2020-01-16 18:34:00,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:00,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330746655] [2020-01-16 18:34:00,188 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:00,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:00,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:00,188 INFO L87 Difference]: Start difference. First operand 790 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:34:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,369 INFO L93 Difference]: Finished difference Result 1388 states and 4881 transitions. [2020-01-16 18:34:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:00,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,373 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:34:00,373 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:34:00,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:34:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 784. [2020-01-16 18:34:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-01-16 18:34:00,394 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-01-16 18:34:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,394 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-01-16 18:34:00,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-01-16 18:34:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:00,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:00,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:00,396 INFO L426 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1471343915, now seen corresponding path program 319 times [2020-01-16 18:34:00,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361493180] [2020-01-16 18:34:00,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361493180] [2020-01-16 18:34:00,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:00,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915934316] [2020-01-16 18:34:00,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:00,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:00,780 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:34:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,930 INFO L93 Difference]: Finished difference Result 1393 states and 4897 transitions. [2020-01-16 18:34:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:00,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,934 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:34:00,934 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:34:00,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:34:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-01-16 18:34:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:34:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:34:00,956 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:34:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,957 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:34:00,957 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:34:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:00,958 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:00,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:00,958 INFO L426 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash -490589197, now seen corresponding path program 320 times [2020-01-16 18:34:00,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963017640] [2020-01-16 18:34:00,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:01,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963017640] [2020-01-16 18:34:01,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:01,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:01,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428859710] [2020-01-16 18:34:01,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:01,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:01,346 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:34:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:01,535 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-01-16 18:34:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:01,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:01,539 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:34:01,539 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:34:01,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:34:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 788. [2020-01-16 18:34:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:34:01,561 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:34:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:01,561 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:34:01,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:34:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:01,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:01,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:01,562 INFO L426 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 11791023, now seen corresponding path program 321 times [2020-01-16 18:34:01,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:01,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891585159] [2020-01-16 18:34:01,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:01,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891585159] [2020-01-16 18:34:01,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:01,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:01,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592040143] [2020-01-16 18:34:01,948 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:01,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:01,948 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:34:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,092 INFO L93 Difference]: Finished difference Result 1401 states and 4910 transitions. [2020-01-16 18:34:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:02,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,095 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:34:02,095 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:34:02,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:34:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 793. [2020-01-16 18:34:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3151 transitions. [2020-01-16 18:34:02,118 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3151 transitions. Word has length 25 [2020-01-16 18:34:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,118 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3151 transitions. [2020-01-16 18:34:02,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3151 transitions. [2020-01-16 18:34:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:02,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:02,119 INFO L426 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1024055053, now seen corresponding path program 322 times [2020-01-16 18:34:02,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131537558] [2020-01-16 18:34:02,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:02,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131537558] [2020-01-16 18:34:02,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:02,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:02,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535815999] [2020-01-16 18:34:02,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:02,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:02,516 INFO L87 Difference]: Start difference. First operand 793 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:34:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,674 INFO L93 Difference]: Finished difference Result 1406 states and 4915 transitions. [2020-01-16 18:34:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:02,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,678 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:34:02,678 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:34:02,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:34:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:34:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:34:02,699 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:34:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,700 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:34:02,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:34:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:02,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:02,701 INFO L426 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 824824661, now seen corresponding path program 323 times [2020-01-16 18:34:02,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649014306] [2020-01-16 18:34:02,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:03,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649014306] [2020-01-16 18:34:03,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:03,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461606114] [2020-01-16 18:34:03,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:03,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:03,083 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:34:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,279 INFO L93 Difference]: Finished difference Result 1398 states and 4899 transitions. [2020-01-16 18:34:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:03,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,283 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:34:03,283 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:34:03,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:34:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-01-16 18:34:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:34:03,305 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:34:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,305 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:34:03,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:34:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:03,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:03,306 INFO L426 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1362680239, now seen corresponding path program 324 times [2020-01-16 18:34:03,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187515161] [2020-01-16 18:34:03,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:03,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187515161] [2020-01-16 18:34:03,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:03,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169497428] [2020-01-16 18:34:03,711 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:03,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:03,712 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:34:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,870 INFO L93 Difference]: Finished difference Result 1404 states and 4907 transitions. [2020-01-16 18:34:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:03,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,874 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:34:03,874 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:34:03,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:34:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 784. [2020-01-16 18:34:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:34:03,896 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:34:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,896 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:34:03,896 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:34:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:03,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:03,897 INFO L426 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1535752789, now seen corresponding path program 325 times [2020-01-16 18:34:03,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172881966] [2020-01-16 18:34:03,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172881966] [2020-01-16 18:34:04,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:04,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736407891] [2020-01-16 18:34:04,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:04,280 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:34:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:04,463 INFO L93 Difference]: Finished difference Result 1402 states and 4917 transitions. [2020-01-16 18:34:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:04,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:04,467 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:34:04,467 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:34:04,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:34:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-01-16 18:34:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:34:04,489 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:34:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:04,489 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:34:04,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:34:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:04,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:04,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:04,490 INFO L426 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1757453581, now seen corresponding path program 326 times [2020-01-16 18:34:04,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:04,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460406608] [2020-01-16 18:34:04,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460406608] [2020-01-16 18:34:04,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906208459] [2020-01-16 18:34:04,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:04,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:04,874 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:34:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,003 INFO L93 Difference]: Finished difference Result 1403 states and 4915 transitions. [2020-01-16 18:34:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:05,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,007 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:34:05,007 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:34:05,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:34:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 789. [2020-01-16 18:34:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:34:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-01-16 18:34:05,028 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-01-16 18:34:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,029 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-01-16 18:34:05,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-01-16 18:34:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:05,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:05,030 INFO L426 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -833180429, now seen corresponding path program 327 times [2020-01-16 18:34:05,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040269812] [2020-01-16 18:34:05,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:05,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040269812] [2020-01-16 18:34:05,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:05,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095784510] [2020-01-16 18:34:05,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:05,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:05,413 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:34:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,558 INFO L93 Difference]: Finished difference Result 1407 states and 4922 transitions. [2020-01-16 18:34:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:05,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,562 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:34:05,562 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:34:05,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:34:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 794. [2020-01-16 18:34:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3150 transitions. [2020-01-16 18:34:05,584 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3150 transitions. Word has length 25 [2020-01-16 18:34:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,584 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3150 transitions. [2020-01-16 18:34:05,584 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3150 transitions. [2020-01-16 18:34:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:05,585 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:05,585 INFO L426 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 179083601, now seen corresponding path program 328 times [2020-01-16 18:34:05,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237586105] [2020-01-16 18:34:05,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:05,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237586105] [2020-01-16 18:34:05,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:05,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644329501] [2020-01-16 18:34:05,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:05,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:05,976 INFO L87 Difference]: Start difference. First operand 794 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:34:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,080 INFO L93 Difference]: Finished difference Result 1412 states and 4927 transitions. [2020-01-16 18:34:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:06,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,083 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:34:06,084 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:34:06,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:34:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 789. [2020-01-16 18:34:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:34:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-01-16 18:34:06,105 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-01-16 18:34:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,105 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-01-16 18:34:06,105 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-01-16 18:34:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:06,106 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:06,106 INFO L426 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash -442039723, now seen corresponding path program 329 times [2020-01-16 18:34:06,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570487765] [2020-01-16 18:34:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:06,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570487765] [2020-01-16 18:34:06,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:06,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:06,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129128950] [2020-01-16 18:34:06,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:06,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:06,491 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:34:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,620 INFO L93 Difference]: Finished difference Result 1410 states and 4924 transitions. [2020-01-16 18:34:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:06,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,624 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:34:06,624 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:34:06,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:34:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 795. [2020-01-16 18:34:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3147 transitions. [2020-01-16 18:34:06,647 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3147 transitions. Word has length 25 [2020-01-16 18:34:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,647 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3147 transitions. [2020-01-16 18:34:06,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3147 transitions. [2020-01-16 18:34:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:06,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:06,648 INFO L426 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1168901235, now seen corresponding path program 330 times [2020-01-16 18:34:06,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399119805] [2020-01-16 18:34:06,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,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-01-16 18:34:07,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399119805] [2020-01-16 18:34:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979817305] [2020-01-16 18:34:07,044 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:07,044 INFO L87 Difference]: Start difference. First operand 795 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:34:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:07,147 INFO L93 Difference]: Finished difference Result 1414 states and 4926 transitions. [2020-01-16 18:34:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:07,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:07,151 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:34:07,151 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:34:07,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:34:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 784. [2020-01-16 18:34:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-01-16 18:34:07,173 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-01-16 18:34:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:07,173 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-01-16 18:34:07,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-01-16 18:34:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:07,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:07,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:07,186 INFO L426 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1250129199, now seen corresponding path program 331 times [2020-01-16 18:34:07,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:07,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817816491] [2020-01-16 18:34:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:07,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817816491] [2020-01-16 18:34:07,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:07,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649094507] [2020-01-16 18:34:07,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:07,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:07,563 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:34:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:07,694 INFO L93 Difference]: Finished difference Result 1395 states and 4894 transitions. [2020-01-16 18:34:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:07,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:07,697 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:34:07,697 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:34:07,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:34:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-01-16 18:34:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:34:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3142 transitions. [2020-01-16 18:34:07,719 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3142 transitions. Word has length 25 [2020-01-16 18:34:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:07,719 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3142 transitions. [2020-01-16 18:34:07,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3142 transitions. [2020-01-16 18:34:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:07,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:07,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] [2020-01-16 18:34:07,720 INFO L426 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752717, now seen corresponding path program 332 times [2020-01-16 18:34:07,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:07,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612341415] [2020-01-16 18:34:07,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612341415] [2020-01-16 18:34:08,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:08,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436882051] [2020-01-16 18:34:08,094 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:08,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:08,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:08,094 INFO L87 Difference]: Start difference. First operand 791 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:34:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,222 INFO L93 Difference]: Finished difference Result 1397 states and 4895 transitions. [2020-01-16 18:34:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:08,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,226 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:34:08,226 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:34:08,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:34:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-01-16 18:34:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:34:08,248 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:34:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,248 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:34:08,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:34:08,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:08,249 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,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] [2020-01-16 18:34:08,249 INFO L426 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1444400243, now seen corresponding path program 333 times [2020-01-16 18:34:08,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905696225] [2020-01-16 18:34:08,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905696225] [2020-01-16 18:34:08,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:08,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875411480] [2020-01-16 18:34:08,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:08,621 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:34:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,748 INFO L93 Difference]: Finished difference Result 1400 states and 4900 transitions. [2020-01-16 18:34:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:08,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,752 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:34:08,752 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:34:08,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:34:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:34:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:34:08,774 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:34:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,775 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:34:08,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:34:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:08,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:08,776 INFO L426 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1982255821, now seen corresponding path program 334 times [2020-01-16 18:34:08,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941598340] [2020-01-16 18:34:08,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:09,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941598340] [2020-01-16 18:34:09,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:09,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:09,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894097260] [2020-01-16 18:34:09,161 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:09,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:09,161 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:34:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,264 INFO L93 Difference]: Finished difference Result 1406 states and 4908 transitions. [2020-01-16 18:34:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:09,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,267 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:34:09,267 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:34:09,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:34:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 788. [2020-01-16 18:34:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-01-16 18:34:09,289 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-01-16 18:34:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,289 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-01-16 18:34:09,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-01-16 18:34:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:09,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:09,290 INFO L426 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1465406451, now seen corresponding path program 335 times [2020-01-16 18:34:09,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365121098] [2020-01-16 18:34:09,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:09,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365121098] [2020-01-16 18:34:09,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:09,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:09,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144125312] [2020-01-16 18:34:09,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:09,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:09,674 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:34:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,799 INFO L93 Difference]: Finished difference Result 1406 states and 4910 transitions. [2020-01-16 18:34:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:09,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,803 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:34:09,803 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:34:09,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:34:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 794. [2020-01-16 18:34:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-01-16 18:34:09,825 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-01-16 18:34:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,825 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-01-16 18:34:09,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-01-16 18:34:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:09,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:09,826 INFO L426 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1218619887, now seen corresponding path program 336 times [2020-01-16 18:34:09,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516127723] [2020-01-16 18:34:09,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516127723] [2020-01-16 18:34:10,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:10,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367742368] [2020-01-16 18:34:10,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:10,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:10,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:10,216 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:34:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,320 INFO L93 Difference]: Finished difference Result 1410 states and 4912 transitions. [2020-01-16 18:34:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:10,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,324 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:34:10,324 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:34:10,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:34:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 780. [2020-01-16 18:34:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:34:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:34:10,345 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:34:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,345 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:34:10,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:34:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:10,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:10,347 INFO L426 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1832995017, now seen corresponding path program 337 times [2020-01-16 18:34:10,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510643744] [2020-01-16 18:34:10,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510643744] [2020-01-16 18:34:10,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:10,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939670596] [2020-01-16 18:34:10,725 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:10,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:10,726 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:34:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,852 INFO L93 Difference]: Finished difference Result 1399 states and 4914 transitions. [2020-01-16 18:34:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:10,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,855 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:34:10,856 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:34:10,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:34:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 790. [2020-01-16 18:34:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-01-16 18:34:10,878 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-01-16 18:34:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,878 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-01-16 18:34:10,878 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-01-16 18:34:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:10,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:10,879 INFO L426 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -222054059, now seen corresponding path program 338 times [2020-01-16 18:34:10,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771733004] [2020-01-16 18:34:10,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:11,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771733004] [2020-01-16 18:34:11,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:11,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188528648] [2020-01-16 18:34:11,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:11,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:11,271 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:34:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:11,393 INFO L93 Difference]: Finished difference Result 1396 states and 4905 transitions. [2020-01-16 18:34:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:11,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:11,397 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:34:11,397 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:34:11,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:34:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 787. [2020-01-16 18:34:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:34:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:34:11,419 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:34:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:11,419 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:34:11,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:34:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:11,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:11,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:11,420 INFO L426 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash -738903429, now seen corresponding path program 339 times [2020-01-16 18:34:11,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:11,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253138795] [2020-01-16 18:34:11,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:11,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253138795] [2020-01-16 18:34:11,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:11,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048562666] [2020-01-16 18:34:11,800 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:11,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:11,800 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:34:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:11,927 INFO L93 Difference]: Finished difference Result 1403 states and 4921 transitions. [2020-01-16 18:34:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:11,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:11,931 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:34:11,931 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:34:11,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:34:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:34:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:34:11,953 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:34:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:11,953 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:34:11,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:34:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:11,954 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:11,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:11,954 INFO L426 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash -201047851, now seen corresponding path program 340 times [2020-01-16 18:34:11,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:11,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31385481] [2020-01-16 18:34:11,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:12,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31385481] [2020-01-16 18:34:12,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:12,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:12,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756636137] [2020-01-16 18:34:12,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:12,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:12,333 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:34:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,460 INFO L93 Difference]: Finished difference Result 1402 states and 4914 transitions. [2020-01-16 18:34:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:12,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,464 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:34:12,464 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:34:12,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:34:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 787. [2020-01-16 18:34:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:34:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-01-16 18:34:12,485 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-01-16 18:34:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:12,485 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-01-16 18:34:12,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-01-16 18:34:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:12,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:12,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:12,487 INFO L426 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash -728400325, now seen corresponding path program 341 times [2020-01-16 18:34:12,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:12,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726245066] [2020-01-16 18:34:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:12,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726245066] [2020-01-16 18:34:12,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:12,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:12,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187517424] [2020-01-16 18:34:12,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:12,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:12,856 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:34:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,977 INFO L93 Difference]: Finished difference Result 1395 states and 4900 transitions. [2020-01-16 18:34:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:12,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,980 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:34:12,980 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:34:12,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:34:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 790. [2020-01-16 18:34:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:34:13,001 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:34:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,002 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:34:13,002 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:34:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:13,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,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] [2020-01-16 18:34:13,003 INFO L426 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1801485705, now seen corresponding path program 342 times [2020-01-16 18:34:13,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392328140] [2020-01-16 18:34:13,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:13,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392328140] [2020-01-16 18:34:13,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:13,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344219864] [2020-01-16 18:34:13,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:13,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:13,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:13,371 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:34:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:13,511 INFO L93 Difference]: Finished difference Result 1397 states and 4901 transitions. [2020-01-16 18:34:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:13,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:13,515 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:34:13,515 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:34:13,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:34:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 784. [2020-01-16 18:34:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:34:13,537 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:34:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,537 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:34:13,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:34:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:13,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:13,538 INFO L426 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 93039061, now seen corresponding path program 343 times [2020-01-16 18:34:13,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084369667] [2020-01-16 18:34:13,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,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-01-16 18:34:13,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084369667] [2020-01-16 18:34:13,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:13,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581442387] [2020-01-16 18:34:13,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:13,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:13,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:13,918 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:34:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,052 INFO L93 Difference]: Finished difference Result 1407 states and 4928 transitions. [2020-01-16 18:34:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:14,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,055 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:34:14,056 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:34:14,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:34:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-01-16 18:34:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:34:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:34:14,077 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:34:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,077 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:34:14,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:34:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:14,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:14,078 INFO L426 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1703980019, now seen corresponding path program 344 times [2020-01-16 18:34:14,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392897904] [2020-01-16 18:34:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392897904] [2020-01-16 18:34:14,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:14,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255808345] [2020-01-16 18:34:14,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:14,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:14,466 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:34:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,589 INFO L93 Difference]: Finished difference Result 1404 states and 4919 transitions. [2020-01-16 18:34:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:14,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,593 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:34:14,593 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:34:14,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:34:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-01-16 18:34:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:34:14,614 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:34:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,614 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:34:14,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:34:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:14,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:14,615 INFO L426 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -413307205, now seen corresponding path program 345 times [2020-01-16 18:34:14,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774571624] [2020-01-16 18:34:14,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774571624] [2020-01-16 18:34:14,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:14,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102908610] [2020-01-16 18:34:14,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:14,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:14,999 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:34:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,128 INFO L93 Difference]: Finished difference Result 1417 states and 4947 transitions. [2020-01-16 18:34:15,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:15,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,132 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:34:15,133 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:34:15,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:34:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-01-16 18:34:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:34:15,164 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:34:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,164 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:34:15,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:34:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:15,165 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:15,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:15,166 INFO L426 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1735489331, now seen corresponding path program 346 times [2020-01-16 18:34:15,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:15,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384206163] [2020-01-16 18:34:15,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:15,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-01-16 18:34:15,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384206163] [2020-01-16 18:34:15,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:15,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:15,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665372217] [2020-01-16 18:34:15,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:15,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:15,549 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:34:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,651 INFO L93 Difference]: Finished difference Result 1420 states and 4946 transitions. [2020-01-16 18:34:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:15,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,655 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:34:15,655 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:34:15,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:34:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 788. [2020-01-16 18:34:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:34:15,676 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:34:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,676 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:34:15,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:34:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:15,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:15,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:15,677 INFO L426 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -402804101, now seen corresponding path program 347 times [2020-01-16 18:34:15,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:15,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473611304] [2020-01-16 18:34:15,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:16,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473611304] [2020-01-16 18:34:16,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:16,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:16,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428021247] [2020-01-16 18:34:16,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:16,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:16,066 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:34:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:16,193 INFO L93 Difference]: Finished difference Result 1408 states and 4922 transitions. [2020-01-16 18:34:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:16,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:16,197 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:34:16,197 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:34:16,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:34:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:34:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:34:16,220 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:34:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:16,220 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:34:16,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:34:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:16,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:16,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:16,221 INFO L426 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash 135051477, now seen corresponding path program 348 times [2020-01-16 18:34:16,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:16,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355525378] [2020-01-16 18:34:16,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:16,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355525378] [2020-01-16 18:34:16,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:16,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:16,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165843584] [2020-01-16 18:34:16,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:16,638 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:34:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:16,769 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-01-16 18:34:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:16,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:16,773 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:34:16,773 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:34:16,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:34:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 784. [2020-01-16 18:34:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-01-16 18:34:16,794 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-01-16 18:34:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:16,794 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-01-16 18:34:16,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-01-16 18:34:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:16,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:16,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:16,795 INFO L426 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 744231509, now seen corresponding path program 349 times [2020-01-16 18:34:16,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:16,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876887847] [2020-01-16 18:34:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:17,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-01-16 18:34:17,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876887847] [2020-01-16 18:34:17,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:17,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:17,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763753718] [2020-01-16 18:34:17,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:17,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:17,195 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:34:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:17,338 INFO L93 Difference]: Finished difference Result 1419 states and 4958 transitions. [2020-01-16 18:34:17,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:17,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:17,341 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:34:17,341 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:34:17,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:34:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-01-16 18:34:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-01-16 18:34:17,372 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-01-16 18:34:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:17,372 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-01-16 18:34:17,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-01-16 18:34:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:17,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:17,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:17,374 INFO L426 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1282087087, now seen corresponding path program 350 times [2020-01-16 18:34:17,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:17,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582218453] [2020-01-16 18:34:17,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582218453] [2020-01-16 18:34:17,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:17,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:17,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005780848] [2020-01-16 18:34:17,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:17,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:17,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:17,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:17,767 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:34:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:17,931 INFO L93 Difference]: Finished difference Result 1418 states and 4951 transitions. [2020-01-16 18:34:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:17,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:17,934 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:34:17,935 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:34:17,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:34:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:34:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:34:17,960 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:34:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:17,960 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:34:17,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:34:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:17,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:17,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:17,961 INFO L426 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -856206345, now seen corresponding path program 351 times [2020-01-16 18:34:17,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:17,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941496252] [2020-01-16 18:34:17,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:18,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941496252] [2020-01-16 18:34:18,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:18,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:18,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495502659] [2020-01-16 18:34:18,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:18,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:18,346 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:34:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:18,490 INFO L93 Difference]: Finished difference Result 1425 states and 4965 transitions. [2020-01-16 18:34:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:18,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:18,494 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:34:18,494 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:34:18,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:34:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 797. [2020-01-16 18:34:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3153 transitions. [2020-01-16 18:34:18,516 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3153 transitions. Word has length 25 [2020-01-16 18:34:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:18,516 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3153 transitions. [2020-01-16 18:34:18,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3153 transitions. [2020-01-16 18:34:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:18,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:18,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:18,518 INFO L426 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1292590191, now seen corresponding path program 352 times [2020-01-16 18:34:18,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:18,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040951221] [2020-01-16 18:34:18,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:18,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-01-16 18:34:18,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040951221] [2020-01-16 18:34:18,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:18,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:18,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897677561] [2020-01-16 18:34:18,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:18,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:18,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:18,904 INFO L87 Difference]: Start difference. First operand 797 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:34:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:19,017 INFO L93 Difference]: Finished difference Result 1428 states and 4964 transitions. [2020-01-16 18:34:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:19,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:19,020 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:34:19,021 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:34:19,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:34:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:34:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3134 transitions. [2020-01-16 18:34:19,042 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3134 transitions. Word has length 25 [2020-01-16 18:34:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:19,042 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3134 transitions. [2020-01-16 18:34:19,042 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3134 transitions. [2020-01-16 18:34:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:19,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:19,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:19,044 INFO L426 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash -824697033, now seen corresponding path program 353 times [2020-01-16 18:34:19,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:19,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342856640] [2020-01-16 18:34:19,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:19,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342856640] [2020-01-16 18:34:19,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:19,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:19,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831340192] [2020-01-16 18:34:19,437 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:19,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:19,438 INFO L87 Difference]: Start difference. First operand 790 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:34:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:19,561 INFO L93 Difference]: Finished difference Result 1422 states and 4952 transitions. [2020-01-16 18:34:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:19,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:19,565 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:34:19,565 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:34:19,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:34:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 796. [2020-01-16 18:34:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:34:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-01-16 18:34:19,586 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-01-16 18:34:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:19,586 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-01-16 18:34:19,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-01-16 18:34:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:19,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:19,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:19,588 INFO L426 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:19,588 INFO L82 PathProgramCache]: Analyzing trace with hash 786243925, now seen corresponding path program 354 times [2020-01-16 18:34:19,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:19,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698850905] [2020-01-16 18:34:19,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:19,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698850905] [2020-01-16 18:34:19,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:19,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:19,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122363300] [2020-01-16 18:34:19,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:19,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:19,971 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:34:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:20,076 INFO L93 Difference]: Finished difference Result 1426 states and 4954 transitions. [2020-01-16 18:34:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:20,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:20,080 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:34:20,080 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:34:20,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:34:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 784. [2020-01-16 18:34:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:34:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:34:20,101 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:34:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:20,101 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:34:20,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:34:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:20,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:20,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:20,102 INFO L426 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1614198605, now seen corresponding path program 355 times [2020-01-16 18:34:20,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:20,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640506387] [2020-01-16 18:34:20,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:20,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640506387] [2020-01-16 18:34:20,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:20,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:20,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172976364] [2020-01-16 18:34:20,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:20,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:20,471 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:34:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:20,602 INFO L93 Difference]: Finished difference Result 1401 states and 4907 transitions. [2020-01-16 18:34:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:20,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:20,605 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:34:20,605 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:34:20,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:34:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-01-16 18:34:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:34:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-01-16 18:34:20,626 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-01-16 18:34:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:20,626 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-01-16 18:34:20,626 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-01-16 18:34:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:20,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:20,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:20,627 INFO L426 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1607683311, now seen corresponding path program 356 times [2020-01-16 18:34:20,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:20,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882780426] [2020-01-16 18:34:20,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:20,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882780426] [2020-01-16 18:34:20,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:20,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:20,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690411407] [2020-01-16 18:34:20,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:20,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:20,998 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:34:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:21,127 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-01-16 18:34:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:21,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:21,130 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:34:21,131 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:34:21,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:34:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 788. [2020-01-16 18:34:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-01-16 18:34:21,152 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-01-16 18:34:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:21,152 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-01-16 18:34:21,152 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-01-16 18:34:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:21,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:21,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:21,153 INFO L426 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1080330837, now seen corresponding path program 357 times [2020-01-16 18:34:21,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:21,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380126123] [2020-01-16 18:34:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:21,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380126123] [2020-01-16 18:34:21,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:21,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:21,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337849701] [2020-01-16 18:34:21,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:21,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:21,518 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:34:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:21,646 INFO L93 Difference]: Finished difference Result 1406 states and 4913 transitions. [2020-01-16 18:34:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:21,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:21,650 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:34:21,650 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:34:21,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:34:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-01-16 18:34:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:34:21,671 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:34:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:21,671 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:34:21,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:34:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:21,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:21,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:21,672 INFO L426 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1618186415, now seen corresponding path program 358 times [2020-01-16 18:34:21,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:21,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751774380] [2020-01-16 18:34:21,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751774380] [2020-01-16 18:34:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:22,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807349325] [2020-01-16 18:34:22,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:22,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:22,043 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:34:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:22,172 INFO L93 Difference]: Finished difference Result 1412 states and 4921 transitions. [2020-01-16 18:34:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:22,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:22,176 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:34:22,176 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:34:22,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:34:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 788. [2020-01-16 18:34:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:34:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3126 transitions. [2020-01-16 18:34:22,197 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3126 transitions. Word has length 25 [2020-01-16 18:34:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:22,197 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3126 transitions. [2020-01-16 18:34:22,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3126 transitions. [2020-01-16 18:34:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:22,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:22,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:22,198 INFO L426 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337045, now seen corresponding path program 359 times [2020-01-16 18:34:22,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:22,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670216578] [2020-01-16 18:34:22,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:22,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-01-16 18:34:22,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670216578] [2020-01-16 18:34:22,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:22,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:22,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253635256] [2020-01-16 18:34:22,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:22,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:22,574 INFO L87 Difference]: Start difference. First operand 788 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:34:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:22,705 INFO L93 Difference]: Finished difference Result 1412 states and 4923 transitions. [2020-01-16 18:34:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:22,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:22,709 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:34:22,709 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:34:22,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:34:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:34:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:34:22,731 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:34:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:22,731 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:34:22,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:34:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:22,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:22,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:22,732 INFO L426 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1582689293, now seen corresponding path program 360 times [2020-01-16 18:34:22,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:22,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283712623] [2020-01-16 18:34:22,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:23,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283712623] [2020-01-16 18:34:23,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:23,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:23,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430082761] [2020-01-16 18:34:23,108 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:23,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:23,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:23,109 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:34:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:23,215 INFO L93 Difference]: Finished difference Result 1416 states and 4925 transitions. [2020-01-16 18:34:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:23,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:23,219 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:34:23,219 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:34:23,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:34:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 776. [2020-01-16 18:34:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:34:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3101 transitions. [2020-01-16 18:34:23,252 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3101 transitions. Word has length 25 [2020-01-16 18:34:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:23,252 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3101 transitions. [2020-01-16 18:34:23,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3101 transitions. [2020-01-16 18:34:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:23,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:23,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:23,253 INFO L426 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash 519656473, now seen corresponding path program 361 times [2020-01-16 18:34:23,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:23,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145692893] [2020-01-16 18:34:23,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:23,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145692893] [2020-01-16 18:34:23,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:23,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:23,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421294921] [2020-01-16 18:34:23,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:23,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:23,631 INFO L87 Difference]: Start difference. First operand 776 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:34:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:23,781 INFO L93 Difference]: Finished difference Result 1450 states and 5092 transitions. [2020-01-16 18:34:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:23,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:23,784 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:34:23,784 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:34:23,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:34:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-01-16 18:34:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3180 transitions. [2020-01-16 18:34:23,806 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3180 transitions. Word has length 25 [2020-01-16 18:34:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:23,806 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3180 transitions. [2020-01-16 18:34:23,806 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3180 transitions. [2020-01-16 18:34:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:23,807 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:23,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:23,807 INFO L426 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1489908087, now seen corresponding path program 362 times [2020-01-16 18:34:23,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:23,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368492259] [2020-01-16 18:34:23,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:24,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368492259] [2020-01-16 18:34:24,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:24,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:24,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634087041] [2020-01-16 18:34:24,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:24,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:24,184 INFO L87 Difference]: Start difference. First operand 797 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:34:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:24,335 INFO L93 Difference]: Finished difference Result 1452 states and 5092 transitions. [2020-01-16 18:34:24,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:24,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:24,339 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:34:24,339 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:34:24,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:34:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 793. [2020-01-16 18:34:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-01-16 18:34:24,361 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-01-16 18:34:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:24,361 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-01-16 18:34:24,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-01-16 18:34:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:24,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:24,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:24,362 INFO L426 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 76757333, now seen corresponding path program 363 times [2020-01-16 18:34:24,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:24,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862085145] [2020-01-16 18:34:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862085145] [2020-01-16 18:34:24,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:24,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954656422] [2020-01-16 18:34:24,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:24,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:24,750 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:34:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:24,876 INFO L93 Difference]: Finished difference Result 1451 states and 5090 transitions. [2020-01-16 18:34:24,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:24,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:24,880 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:34:24,880 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:34:24,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:34:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 797. [2020-01-16 18:34:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-01-16 18:34:24,902 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-01-16 18:34:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:24,902 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-01-16 18:34:24,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-01-16 18:34:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:24,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:24,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:24,903 INFO L426 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1068015155, now seen corresponding path program 364 times [2020-01-16 18:34:24,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:24,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535005055] [2020-01-16 18:34:24,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:25,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535005055] [2020-01-16 18:34:25,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:25,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:25,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248290610] [2020-01-16 18:34:25,282 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:25,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:25,282 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:34:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:25,415 INFO L93 Difference]: Finished difference Result 1454 states and 5092 transitions. [2020-01-16 18:34:25,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:25,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:25,418 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:34:25,418 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:34:25,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:34:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 793. [2020-01-16 18:34:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:34:25,440 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:34:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:25,440 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:34:25,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:34:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:25,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:25,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:25,441 INFO L426 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2140837799, now seen corresponding path program 365 times [2020-01-16 18:34:25,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:25,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737595381] [2020-01-16 18:34:25,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:25,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737595381] [2020-01-16 18:34:25,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:25,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:25,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883452741] [2020-01-16 18:34:25,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:25,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:25,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:25,827 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:34:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:25,956 INFO L93 Difference]: Finished difference Result 1457 states and 5100 transitions. [2020-01-16 18:34:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:25,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:25,960 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:34:25,960 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:34:25,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:34:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2020-01-16 18:34:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3176 transitions. [2020-01-16 18:34:25,981 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3176 transitions. Word has length 25 [2020-01-16 18:34:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:25,981 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3176 transitions. [2020-01-16 18:34:25,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3176 transitions. [2020-01-16 18:34:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:25,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:25,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:25,983 INFO L426 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1081044117, now seen corresponding path program 366 times [2020-01-16 18:34:25,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:25,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654286205] [2020-01-16 18:34:25,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:26,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-01-16 18:34:26,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654286205] [2020-01-16 18:34:26,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:26,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:26,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559970531] [2020-01-16 18:34:26,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:26,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:26,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:26,371 INFO L87 Difference]: Start difference. First operand 799 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:34:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:26,509 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:34:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:26,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:26,513 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:34:26,513 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:34:26,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:34:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-01-16 18:34:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:34:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:34:26,534 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:34:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:26,535 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:34:26,535 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:34:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:26,536 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:26,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:26,536 INFO L426 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash 97170747, now seen corresponding path program 367 times [2020-01-16 18:34:26,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:26,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091201209] [2020-01-16 18:34:26,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:26,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091201209] [2020-01-16 18:34:26,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:26,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:26,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648944981] [2020-01-16 18:34:26,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:26,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:26,926 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:34:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:27,056 INFO L93 Difference]: Finished difference Result 1447 states and 5081 transitions. [2020-01-16 18:34:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:27,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:27,060 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:34:27,060 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:34:27,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:34:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:34:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-01-16 18:34:27,081 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-01-16 18:34:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:27,082 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-01-16 18:34:27,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-01-16 18:34:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:27,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:27,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:27,083 INFO L426 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1067422361, now seen corresponding path program 368 times [2020-01-16 18:34:27,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:27,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096502624] [2020-01-16 18:34:27,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:27,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096502624] [2020-01-16 18:34:27,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:27,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:27,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204905542] [2020-01-16 18:34:27,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:27,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:27,475 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:34:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:27,600 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-01-16 18:34:27,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:27,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:27,603 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:34:27,603 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:34:27,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:34:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:34:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:34:27,624 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:34:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:27,625 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:34:27,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:34:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:27,626 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:27,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:27,626 INFO L426 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1580305685, now seen corresponding path program 369 times [2020-01-16 18:34:27,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:27,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117312076] [2020-01-16 18:34:27,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:28,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117312076] [2020-01-16 18:34:28,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:28,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:28,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294727693] [2020-01-16 18:34:28,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:28,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:28,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:28,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:28,016 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:34:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:28,163 INFO L93 Difference]: Finished difference Result 1446 states and 5075 transitions. [2020-01-16 18:34:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:28,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:28,167 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:34:28,167 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:34:28,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:34:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 797. [2020-01-16 18:34:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-01-16 18:34:28,189 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-01-16 18:34:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:28,189 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-01-16 18:34:28,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-01-16 18:34:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:28,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:28,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:28,190 INFO L426 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1712900685, now seen corresponding path program 370 times [2020-01-16 18:34:28,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:28,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128652692] [2020-01-16 18:34:28,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:28,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128652692] [2020-01-16 18:34:28,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:28,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:28,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210847393] [2020-01-16 18:34:28,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:28,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:28,592 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:34:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:28,721 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-01-16 18:34:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:28,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:28,724 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:34:28,725 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:34:28,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:34:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-01-16 18:34:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:34:28,746 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:34:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:28,746 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:34:28,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:34:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:28,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:28,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:28,748 INFO L426 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2057239995, now seen corresponding path program 371 times [2020-01-16 18:34:28,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:28,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127026626] [2020-01-16 18:34:28,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:29,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127026626] [2020-01-16 18:34:29,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:29,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:29,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012432929] [2020-01-16 18:34:29,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:29,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:29,135 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:34:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:29,275 INFO L93 Difference]: Finished difference Result 1451 states and 5082 transitions. [2020-01-16 18:34:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:29,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:29,278 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:34:29,279 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:34:29,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:34:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-01-16 18:34:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-01-16 18:34:29,300 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-01-16 18:34:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:29,301 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-01-16 18:34:29,301 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-01-16 18:34:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:29,302 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:29,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:29,302 INFO L426 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:29,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1699871723, now seen corresponding path program 372 times [2020-01-16 18:34:29,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:29,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633046636] [2020-01-16 18:34:29,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:29,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-01-16 18:34:29,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633046636] [2020-01-16 18:34:29,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:29,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:29,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571846509] [2020-01-16 18:34:29,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:29,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:29,695 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:34:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:29,831 INFO L93 Difference]: Finished difference Result 1450 states and 5075 transitions. [2020-01-16 18:34:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:29,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:29,835 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:34:29,835 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:34:29,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:34:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2020-01-16 18:34:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:34:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-01-16 18:34:29,857 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-01-16 18:34:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:29,857 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-01-16 18:34:29,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-01-16 18:34:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:29,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:29,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:29,858 INFO L426 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699845, now seen corresponding path program 373 times [2020-01-16 18:34:29,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:29,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396520511] [2020-01-16 18:34:29,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:30,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396520511] [2020-01-16 18:34:30,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:30,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:30,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675430958] [2020-01-16 18:34:30,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:30,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:30,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:30,241 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:34:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:30,374 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-01-16 18:34:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:30,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:30,378 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:34:30,378 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:34:30,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:34:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-01-16 18:34:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-01-16 18:34:30,399 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-01-16 18:34:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:30,399 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-01-16 18:34:30,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-01-16 18:34:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:30,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:30,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:30,401 INFO L426 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -199442023, now seen corresponding path program 374 times [2020-01-16 18:34:30,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:30,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059996022] [2020-01-16 18:34:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059996022] [2020-01-16 18:34:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:30,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:30,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444231739] [2020-01-16 18:34:30,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:30,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:30,777 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:34:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:30,921 INFO L93 Difference]: Finished difference Result 1452 states and 5083 transitions. [2020-01-16 18:34:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:30,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:30,925 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:34:30,925 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:34:30,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:34:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 793. [2020-01-16 18:34:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:34:30,947 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:34:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:30,947 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:34:30,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:34:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:30,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:30,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:30,948 INFO L426 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash 735334233, now seen corresponding path program 375 times [2020-01-16 18:34:30,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:30,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308834144] [2020-01-16 18:34:30,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:31,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308834144] [2020-01-16 18:34:31,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:31,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:31,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587847860] [2020-01-16 18:34:31,348 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:31,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:31,348 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:34:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:31,474 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-01-16 18:34:31,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:31,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:31,477 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:34:31,477 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:34:31,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:34:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:34:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:34:31,499 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:34:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:31,499 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:34:31,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:34:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:31,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:31,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:31,500 INFO L426 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1737095159, now seen corresponding path program 376 times [2020-01-16 18:34:31,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:31,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457731614] [2020-01-16 18:34:31,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457731614] [2020-01-16 18:34:31,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:31,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:31,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085719756] [2020-01-16 18:34:31,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:31,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:31,892 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:34:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:32,024 INFO L93 Difference]: Finished difference Result 1448 states and 5071 transitions. [2020-01-16 18:34:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:32,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:32,028 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:34:32,028 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:34:32,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:34:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:34:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:34:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:34:32,050 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:34:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:32,050 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:34:32,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:34:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:32,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:32,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:32,052 INFO L426 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 790375611, now seen corresponding path program 377 times [2020-01-16 18:34:32,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:32,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472495536] [2020-01-16 18:34:32,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:32,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472495536] [2020-01-16 18:34:32,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:32,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:32,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977734801] [2020-01-16 18:34:32,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:32,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:32,429 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:34:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:32,578 INFO L93 Difference]: Finished difference Result 1454 states and 5084 transitions. [2020-01-16 18:34:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:32,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:32,582 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:34:32,584 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:34:32,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:34:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 798. [2020-01-16 18:34:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-01-16 18:34:32,607 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-01-16 18:34:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:32,607 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-01-16 18:34:32,607 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-01-16 18:34:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:32,608 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:32,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:32,609 INFO L426 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1893650727, now seen corresponding path program 378 times [2020-01-16 18:34:32,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:32,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470069615] [2020-01-16 18:34:32,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:32,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470069615] [2020-01-16 18:34:32,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:32,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:32,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406621491] [2020-01-16 18:34:32,989 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:32,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:32,990 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:34:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:33,122 INFO L93 Difference]: Finished difference Result 1452 states and 5075 transitions. [2020-01-16 18:34:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:33,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:33,127 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:34:33,127 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:34:33,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:34:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 789. [2020-01-16 18:34:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:34:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-01-16 18:34:33,150 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-01-16 18:34:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:33,150 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-01-16 18:34:33,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-01-16 18:34:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:33,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:33,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:33,151 INFO L426 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1521262217, now seen corresponding path program 379 times [2020-01-16 18:34:33,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:33,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269120127] [2020-01-16 18:34:33,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:33,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269120127] [2020-01-16 18:34:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521303698] [2020-01-16 18:34:33,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:33,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:33,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:33,542 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:34:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:33,664 INFO L93 Difference]: Finished difference Result 1461 states and 5108 transitions. [2020-01-16 18:34:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:33,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:33,668 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:34:33,668 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:34:33,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:34:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 800. [2020-01-16 18:34:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:34:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3176 transitions. [2020-01-16 18:34:33,690 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3176 transitions. Word has length 25 [2020-01-16 18:34:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:33,690 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3176 transitions. [2020-01-16 18:34:33,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3176 transitions. [2020-01-16 18:34:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:33,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:33,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:33,691 INFO L426 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1700619699, now seen corresponding path program 380 times [2020-01-16 18:34:33,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:33,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867285239] [2020-01-16 18:34:33,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:34,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867285239] [2020-01-16 18:34:34,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:34,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:34,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507737372] [2020-01-16 18:34:34,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:34,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:34,084 INFO L87 Difference]: Start difference. First operand 800 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:34:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:34,214 INFO L93 Difference]: Finished difference Result 1462 states and 5104 transitions. [2020-01-16 18:34:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:34,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:34,218 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:34:34,218 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:34:34,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:34:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 794. [2020-01-16 18:34:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3160 transitions. [2020-01-16 18:34:34,240 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3160 transitions. Word has length 25 [2020-01-16 18:34:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:34,240 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3160 transitions. [2020-01-16 18:34:34,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3160 transitions. [2020-01-16 18:34:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:34,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:34,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:34,241 INFO L426 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1173267225, now seen corresponding path program 381 times [2020-01-16 18:34:34,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:34,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915601802] [2020-01-16 18:34:34,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:34,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-01-16 18:34:34,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915601802] [2020-01-16 18:34:34,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:34,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:34,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004932065] [2020-01-16 18:34:34,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:34,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:34,630 INFO L87 Difference]: Start difference. First operand 794 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:34:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:34,756 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:34:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:34,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:34,760 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:34:34,760 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:34:34,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:34:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 799. [2020-01-16 18:34:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3169 transitions. [2020-01-16 18:34:34,782 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3169 transitions. Word has length 25 [2020-01-16 18:34:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:34,783 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3169 transitions. [2020-01-16 18:34:34,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3169 transitions. [2020-01-16 18:34:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:34,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:34,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:34,784 INFO L426 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1711122803, now seen corresponding path program 382 times [2020-01-16 18:34:34,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:34,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547986278] [2020-01-16 18:34:34,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:35,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547986278] [2020-01-16 18:34:35,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:35,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:35,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996418867] [2020-01-16 18:34:35,171 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:35,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:35,171 INFO L87 Difference]: Start difference. First operand 799 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:34:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:35,300 INFO L93 Difference]: Finished difference Result 1457 states and 5089 transitions. [2020-01-16 18:34:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:35,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:35,304 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:34:35,304 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:34:35,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:34:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-01-16 18:34:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-01-16 18:34:35,324 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-01-16 18:34:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:35,325 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-01-16 18:34:35,325 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-01-16 18:34:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:35,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:35,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:35,326 INFO L426 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1194273433, now seen corresponding path program 383 times [2020-01-16 18:34:35,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:35,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734384654] [2020-01-16 18:34:35,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:35,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-01-16 18:34:35,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734384654] [2020-01-16 18:34:35,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:35,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712233195] [2020-01-16 18:34:35,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:35,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:35,724 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:34:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:35,847 INFO L93 Difference]: Finished difference Result 1460 states and 5095 transitions. [2020-01-16 18:34:35,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:35,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:35,851 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:34:35,851 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:34:35,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:34:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 799. [2020-01-16 18:34:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3164 transitions. [2020-01-16 18:34:35,873 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3164 transitions. Word has length 25 [2020-01-16 18:34:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:35,873 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3164 transitions. [2020-01-16 18:34:35,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3164 transitions. [2020-01-16 18:34:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:35,874 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:35,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:35,874 INFO L426 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1489752905, now seen corresponding path program 384 times [2020-01-16 18:34:35,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:35,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412416519] [2020-01-16 18:34:35,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:36,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412416519] [2020-01-16 18:34:36,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:36,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:36,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053197702] [2020-01-16 18:34:36,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:36,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:36,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:36,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:36,264 INFO L87 Difference]: Start difference. First operand 799 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:34:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:36,396 INFO L93 Difference]: Finished difference Result 1458 states and 5086 transitions. [2020-01-16 18:34:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:36,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:36,400 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:34:36,400 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:34:36,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:34:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 785. [2020-01-16 18:34:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:34:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:34:36,421 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:34:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:36,421 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:34:36,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:34:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:36,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:36,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:36,423 INFO L426 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 307500855, now seen corresponding path program 385 times [2020-01-16 18:34:36,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481498464] [2020-01-16 18:34:36,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:36,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481498464] [2020-01-16 18:34:36,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:36,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:36,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376015918] [2020-01-16 18:34:36,804 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:36,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:36,804 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:34:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:36,937 INFO L93 Difference]: Finished difference Result 1471 states and 5138 transitions. [2020-01-16 18:34:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:36,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:36,940 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:34:36,940 INFO L226 Difference]: Without dead ends: 1458 [2020-01-16 18:34:36,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-01-16 18:34:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 800. [2020-01-16 18:34:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:34:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3185 transitions. [2020-01-16 18:34:36,962 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3185 transitions. Word has length 25 [2020-01-16 18:34:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:36,962 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3185 transitions. [2020-01-16 18:34:36,962 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3185 transitions. [2020-01-16 18:34:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:36,963 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:36,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:36,963 INFO L426 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1277752469, now seen corresponding path program 386 times [2020-01-16 18:34:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111909418] [2020-01-16 18:34:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:37,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-01-16 18:34:37,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111909418] [2020-01-16 18:34:37,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:37,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:37,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332887257] [2020-01-16 18:34:37,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:37,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:37,355 INFO L87 Difference]: Start difference. First operand 800 states and 3185 transitions. Second operand 10 states. [2020-01-16 18:34:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:37,489 INFO L93 Difference]: Finished difference Result 1473 states and 5138 transitions. [2020-01-16 18:34:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:37,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:37,493 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:34:37,493 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:34:37,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:34:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-01-16 18:34:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:34:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3174 transitions. [2020-01-16 18:34:37,516 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3174 transitions. Word has length 25 [2020-01-16 18:34:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:37,516 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3174 transitions. [2020-01-16 18:34:37,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3174 transitions. [2020-01-16 18:34:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:37,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:37,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:37,517 INFO L426 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash -135398285, now seen corresponding path program 387 times [2020-01-16 18:34:37,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:37,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359618058] [2020-01-16 18:34:37,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:37,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359618058] [2020-01-16 18:34:37,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:37,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:37,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904044398] [2020-01-16 18:34:37,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:37,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:37,901 INFO L87 Difference]: Start difference. First operand 796 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:34:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:38,035 INFO L93 Difference]: Finished difference Result 1472 states and 5136 transitions. [2020-01-16 18:34:38,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:38,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:38,039 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:34:38,039 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:34:38,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:34:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 800. [2020-01-16 18:34:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:34:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3181 transitions. [2020-01-16 18:34:38,061 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3181 transitions. Word has length 25 [2020-01-16 18:34:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:38,061 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3181 transitions. [2020-01-16 18:34:38,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3181 transitions. [2020-01-16 18:34:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:38,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:38,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:38,063 INFO L426 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash 855859537, now seen corresponding path program 388 times [2020-01-16 18:34:38,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:38,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734039268] [2020-01-16 18:34:38,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:38,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734039268] [2020-01-16 18:34:38,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:38,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:38,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898560819] [2020-01-16 18:34:38,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:38,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:38,445 INFO L87 Difference]: Start difference. First operand 800 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:34:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:38,581 INFO L93 Difference]: Finished difference Result 1475 states and 5138 transitions. [2020-01-16 18:34:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:38,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:38,584 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:34:38,584 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:34:38,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:34:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2020-01-16 18:34:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:34:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3170 transitions. [2020-01-16 18:34:38,606 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3170 transitions. Word has length 25 [2020-01-16 18:34:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:38,606 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3170 transitions. [2020-01-16 18:34:38,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3170 transitions. [2020-01-16 18:34:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:38,607 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:38,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:38,607 INFO L426 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1941973879, now seen corresponding path program 389 times [2020-01-16 18:34:38,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:38,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833160323] [2020-01-16 18:34:38,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:38,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833160323] [2020-01-16 18:34:38,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:38,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:38,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478616148] [2020-01-16 18:34:38,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:38,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:38,994 INFO L87 Difference]: Start difference. First operand 796 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:34:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:39,123 INFO L93 Difference]: Finished difference Result 1478 states and 5146 transitions. [2020-01-16 18:34:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:39,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:39,126 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:34:39,126 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:34:39,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:34:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 802. [2020-01-16 18:34:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:34:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-01-16 18:34:39,148 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-01-16 18:34:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:39,148 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-01-16 18:34:39,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-01-16 18:34:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:39,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:39,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:39,149 INFO L426 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash 868888499, now seen corresponding path program 390 times [2020-01-16 18:34:39,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:39,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998395610] [2020-01-16 18:34:39,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:39,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998395610] [2020-01-16 18:34:39,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:39,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:39,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598792007] [2020-01-16 18:34:39,553 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:39,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:39,553 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:34:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:39,700 INFO L93 Difference]: Finished difference Result 1479 states and 5142 transitions. [2020-01-16 18:34:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:39,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:39,704 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:34:39,704 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:34:39,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:34:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-01-16 18:34:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3159 transitions. [2020-01-16 18:34:39,725 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3159 transitions. Word has length 25 [2020-01-16 18:34:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:39,725 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3159 transitions. [2020-01-16 18:34:39,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3159 transitions. [2020-01-16 18:34:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:39,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:39,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:39,726 INFO L426 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -537470597, now seen corresponding path program 391 times [2020-01-16 18:34:39,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:39,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437698125] [2020-01-16 18:34:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:40,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437698125] [2020-01-16 18:34:40,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:40,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:40,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160550245] [2020-01-16 18:34:40,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:40,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:40,102 INFO L87 Difference]: Start difference. First operand 792 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:34:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:40,247 INFO L93 Difference]: Finished difference Result 1476 states and 5144 transitions. [2020-01-16 18:34:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:40,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:40,251 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:34:40,251 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:34:40,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:34:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 801. [2020-01-16 18:34:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:34:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3184 transitions. [2020-01-16 18:34:40,272 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3184 transitions. Word has length 25 [2020-01-16 18:34:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:40,273 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3184 transitions. [2020-01-16 18:34:40,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3184 transitions. [2020-01-16 18:34:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:40,274 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:40,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:40,274 INFO L426 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 432781017, now seen corresponding path program 392 times [2020-01-16 18:34:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:40,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785977923] [2020-01-16 18:34:40,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:40,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785977923] [2020-01-16 18:34:40,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:40,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:40,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340077678] [2020-01-16 18:34:40,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:40,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:40,664 INFO L87 Difference]: Start difference. First operand 801 states and 3184 transitions. Second operand 10 states. [2020-01-16 18:34:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:40,802 INFO L93 Difference]: Finished difference Result 1478 states and 5144 transitions. [2020-01-16 18:34:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:40,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:40,805 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:34:40,806 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:34:40,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:34:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 797. [2020-01-16 18:34:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3173 transitions. [2020-01-16 18:34:40,827 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3173 transitions. Word has length 25 [2020-01-16 18:34:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:40,827 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3173 transitions. [2020-01-16 18:34:40,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3173 transitions. [2020-01-16 18:34:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:40,828 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:40,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:40,828 INFO L426 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1423268877, now seen corresponding path program 393 times [2020-01-16 18:34:40,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:40,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721906962] [2020-01-16 18:34:40,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:41,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721906962] [2020-01-16 18:34:41,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:41,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:41,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475723325] [2020-01-16 18:34:41,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:41,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:41,212 INFO L87 Difference]: Start difference. First operand 797 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:34:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:41,368 INFO L93 Difference]: Finished difference Result 1480 states and 5147 transitions. [2020-01-16 18:34:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:41,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:41,371 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:34:41,371 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:34:41,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:34:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 802. [2020-01-16 18:34:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:34:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3182 transitions. [2020-01-16 18:34:41,392 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3182 transitions. Word has length 25 [2020-01-16 18:34:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:41,393 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3182 transitions. [2020-01-16 18:34:41,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3182 transitions. [2020-01-16 18:34:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:41,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:41,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:41,394 INFO L426 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash -411004847, now seen corresponding path program 394 times [2020-01-16 18:34:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245726581] [2020-01-16 18:34:41,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:41,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245726581] [2020-01-16 18:34:41,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:41,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776109061] [2020-01-16 18:34:41,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:41,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:41,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:41,799 INFO L87 Difference]: Start difference. First operand 802 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:34:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:41,910 INFO L93 Difference]: Finished difference Result 1485 states and 5152 transitions. [2020-01-16 18:34:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:41,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:41,914 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:34:41,914 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:34:41,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:34:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 797. [2020-01-16 18:34:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:34:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:34:41,936 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:34:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:41,936 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:34:41,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:34:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:41,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:41,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:41,937 INFO L426 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1748194875, now seen corresponding path program 395 times [2020-01-16 18:34:41,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:41,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793352138] [2020-01-16 18:34:41,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:42,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793352138] [2020-01-16 18:34:42,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:42,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:42,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146469083] [2020-01-16 18:34:42,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:42,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:42,324 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:34:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:42,467 INFO L93 Difference]: Finished difference Result 1486 states and 5156 transitions. [2020-01-16 18:34:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:42,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:42,471 INFO L225 Difference]: With dead ends: 1486 [2020-01-16 18:34:42,471 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:34:42,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:34:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-01-16 18:34:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:34:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3181 transitions. [2020-01-16 18:34:42,493 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3181 transitions. Word has length 25 [2020-01-16 18:34:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:42,493 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3181 transitions. [2020-01-16 18:34:42,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3181 transitions. [2020-01-16 18:34:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:42,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:42,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:42,494 INFO L426 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -397975885, now seen corresponding path program 396 times [2020-01-16 18:34:42,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141112970] [2020-01-16 18:34:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:42,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141112970] [2020-01-16 18:34:42,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:42,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:42,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120374348] [2020-01-16 18:34:42,893 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:42,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:42,893 INFO L87 Difference]: Start difference. First operand 804 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:34:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:43,043 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-01-16 18:34:43,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:43,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:43,046 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:34:43,046 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:34:43,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:34:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 792. [2020-01-16 18:34:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-01-16 18:34:43,067 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-01-16 18:34:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:43,067 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-01-16 18:34:43,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-01-16 18:34:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:43,068 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:43,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:43,069 INFO L426 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1825341189, now seen corresponding path program 397 times [2020-01-16 18:34:43,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:43,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747703964] [2020-01-16 18:34:43,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:43,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747703964] [2020-01-16 18:34:43,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:43,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:43,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955522464] [2020-01-16 18:34:43,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:43,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:43,453 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:34:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:43,595 INFO L93 Difference]: Finished difference Result 1481 states and 5149 transitions. [2020-01-16 18:34:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:43,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:43,599 INFO L225 Difference]: With dead ends: 1481 [2020-01-16 18:34:43,599 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:34:43,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:34:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 802. [2020-01-16 18:34:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:34:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-01-16 18:34:43,621 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-01-16 18:34:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:43,621 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-01-16 18:34:43,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-01-16 18:34:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:43,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:43,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:43,622 INFO L426 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash -834083367, now seen corresponding path program 398 times [2020-01-16 18:34:43,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:43,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084262632] [2020-01-16 18:34:43,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:44,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084262632] [2020-01-16 18:34:44,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:44,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:44,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632839140] [2020-01-16 18:34:44,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:44,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:44,029 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:34:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:44,171 INFO L93 Difference]: Finished difference Result 1484 states and 5151 transitions. [2020-01-16 18:34:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:44,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:44,175 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:34:44,175 INFO L226 Difference]: Without dead ends: 1464 [2020-01-16 18:34:44,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-01-16 18:34:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 798. [2020-01-16 18:34:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-01-16 18:34:44,197 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-01-16 18:34:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:44,197 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-01-16 18:34:44,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-01-16 18:34:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:44,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:44,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:44,198 INFO L426 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2026726967, now seen corresponding path program 399 times [2020-01-16 18:34:44,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:44,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084540479] [2020-01-16 18:34:44,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:44,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084540479] [2020-01-16 18:34:44,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:44,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:44,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869988040] [2020-01-16 18:34:44,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:44,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:44,581 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:34:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:44,722 INFO L93 Difference]: Finished difference Result 1484 states and 5150 transitions. [2020-01-16 18:34:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:44,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:44,726 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:34:44,727 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:34:44,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:34:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 803. [2020-01-16 18:34:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:34:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3179 transitions. [2020-01-16 18:34:44,749 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3179 transitions. Word has length 25 [2020-01-16 18:34:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:44,749 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3179 transitions. [2020-01-16 18:34:44,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3179 transitions. [2020-01-16 18:34:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:44,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:44,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:44,750 INFO L426 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:44,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1255976299, now seen corresponding path program 400 times [2020-01-16 18:34:44,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:44,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29374555] [2020-01-16 18:34:44,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:45,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-01-16 18:34:45,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29374555] [2020-01-16 18:34:45,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:45,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:45,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686200527] [2020-01-16 18:34:45,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:45,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:45,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:45,150 INFO L87 Difference]: Start difference. First operand 803 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:34:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:45,268 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-01-16 18:34:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:45,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:45,272 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:34:45,272 INFO L226 Difference]: Without dead ends: 1466 [2020-01-16 18:34:45,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-01-16 18:34:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 798. [2020-01-16 18:34:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3165 transitions. [2020-01-16 18:34:45,293 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3165 transitions. Word has length 25 [2020-01-16 18:34:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:45,293 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3165 transitions. [2020-01-16 18:34:45,294 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3165 transitions. [2020-01-16 18:34:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:45,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:45,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:45,295 INFO L426 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash 481330491, now seen corresponding path program 401 times [2020-01-16 18:34:45,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146912397] [2020-01-16 18:34:45,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:45,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-01-16 18:34:45,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146912397] [2020-01-16 18:34:45,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:45,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:45,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294874537] [2020-01-16 18:34:45,692 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:45,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:45,693 INFO L87 Difference]: Start difference. First operand 798 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:34:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:45,874 INFO L93 Difference]: Finished difference Result 1494 states and 5167 transitions. [2020-01-16 18:34:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:45,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:45,878 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:34:45,878 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:34:45,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:34:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 807. [2020-01-16 18:34:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:34:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3181 transitions. [2020-01-16 18:34:45,899 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3181 transitions. Word has length 25 [2020-01-16 18:34:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:45,899 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3181 transitions. [2020-01-16 18:34:45,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3181 transitions. [2020-01-16 18:34:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:45,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:45,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:45,901 INFO L426 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash -591754889, now seen corresponding path program 402 times [2020-01-16 18:34:45,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:45,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892909450] [2020-01-16 18:34:45,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:46,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892909450] [2020-01-16 18:34:46,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:46,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:46,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153644644] [2020-01-16 18:34:46,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:46,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:46,302 INFO L87 Difference]: Start difference. First operand 807 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:34:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:46,466 INFO L93 Difference]: Finished difference Result 1496 states and 5163 transitions. [2020-01-16 18:34:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:46,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:46,469 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:34:46,469 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:34:46,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:34:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 792. [2020-01-16 18:34:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:34:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3148 transitions. [2020-01-16 18:34:46,490 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3148 transitions. Word has length 25 [2020-01-16 18:34:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:46,490 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3148 transitions. [2020-01-16 18:34:46,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3148 transitions. [2020-01-16 18:34:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:46,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:46,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:46,491 INFO L426 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash -229869483, now seen corresponding path program 403 times [2020-01-16 18:34:46,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:46,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89954445] [2020-01-16 18:34:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:46,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89954445] [2020-01-16 18:34:46,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:46,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:46,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553649978] [2020-01-16 18:34:46,882 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:46,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:46,883 INFO L87 Difference]: Start difference. First operand 792 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:34:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:47,021 INFO L93 Difference]: Finished difference Result 1496 states and 5182 transitions. [2020-01-16 18:34:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:47,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:47,025 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:34:47,025 INFO L226 Difference]: Without dead ends: 1481 [2020-01-16 18:34:47,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-01-16 18:34:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 807. [2020-01-16 18:34:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:34:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3188 transitions. [2020-01-16 18:34:47,047 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3188 transitions. Word has length 25 [2020-01-16 18:34:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:47,047 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3188 transitions. [2020-01-16 18:34:47,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3188 transitions. [2020-01-16 18:34:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:47,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:47,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:47,048 INFO L426 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954863, now seen corresponding path program 404 times [2020-01-16 18:34:47,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:47,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340932829] [2020-01-16 18:34:47,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:47,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-01-16 18:34:47,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340932829] [2020-01-16 18:34:47,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:47,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:47,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267938371] [2020-01-16 18:34:47,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:47,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:47,447 INFO L87 Difference]: Start difference. First operand 807 states and 3188 transitions. Second operand 10 states. [2020-01-16 18:34:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:47,583 INFO L93 Difference]: Finished difference Result 1497 states and 5178 transitions. [2020-01-16 18:34:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:47,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:47,587 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:34:47,587 INFO L226 Difference]: Without dead ends: 1475 [2020-01-16 18:34:47,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-01-16 18:34:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 801. [2020-01-16 18:34:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:34:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3171 transitions. [2020-01-16 18:34:47,608 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3171 transitions. Word has length 25 [2020-01-16 18:34:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:47,608 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3171 transitions. [2020-01-16 18:34:47,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3171 transitions. [2020-01-16 18:34:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:47,610 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:47,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:47,610 INFO L426 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash 864222105, now seen corresponding path program 405 times [2020-01-16 18:34:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843143500] [2020-01-16 18:34:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:48,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-01-16 18:34:48,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843143500] [2020-01-16 18:34:48,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:48,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:48,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486560300] [2020-01-16 18:34:48,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:48,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:48,017 INFO L87 Difference]: Start difference. First operand 801 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:34:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:48,153 INFO L93 Difference]: Finished difference Result 1499 states and 5181 transitions. [2020-01-16 18:34:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:48,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:48,157 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:34:48,158 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:34:48,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:34:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 808. [2020-01-16 18:34:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:34:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3184 transitions. [2020-01-16 18:34:48,179 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3184 transitions. Word has length 25 [2020-01-16 18:34:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:48,179 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3184 transitions. [2020-01-16 18:34:48,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3184 transitions. [2020-01-16 18:34:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:48,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:48,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:48,181 INFO L426 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1281948655, now seen corresponding path program 406 times [2020-01-16 18:34:48,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:48,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091478242] [2020-01-16 18:34:48,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:48,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091478242] [2020-01-16 18:34:48,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:48,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:48,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804314974] [2020-01-16 18:34:48,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:48,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:48,580 INFO L87 Difference]: Start difference. First operand 808 states and 3184 transitions. Second operand 10 states. [2020-01-16 18:34:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:48,696 INFO L93 Difference]: Finished difference Result 1502 states and 5180 transitions. [2020-01-16 18:34:48,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:48,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:48,700 INFO L225 Difference]: With dead ends: 1502 [2020-01-16 18:34:48,700 INFO L226 Difference]: Without dead ends: 1477 [2020-01-16 18:34:48,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-01-16 18:34:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 801. [2020-01-16 18:34:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:34:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3164 transitions. [2020-01-16 18:34:48,722 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3164 transitions. Word has length 25 [2020-01-16 18:34:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:48,722 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3164 transitions. [2020-01-16 18:34:48,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3164 transitions. [2020-01-16 18:34:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:48,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:48,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:48,723 INFO L426 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash 885228313, now seen corresponding path program 407 times [2020-01-16 18:34:48,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:48,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952629273] [2020-01-16 18:34:48,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:49,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952629273] [2020-01-16 18:34:49,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:49,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:49,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782621413] [2020-01-16 18:34:49,123 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:49,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:49,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:49,123 INFO L87 Difference]: Start difference. First operand 801 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:34:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:49,306 INFO L93 Difference]: Finished difference Result 1503 states and 5182 transitions. [2020-01-16 18:34:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:49,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:49,310 INFO L225 Difference]: With dead ends: 1503 [2020-01-16 18:34:49,310 INFO L226 Difference]: Without dead ends: 1487 [2020-01-16 18:34:49,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-01-16 18:34:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 810. [2020-01-16 18:34:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:34:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3180 transitions. [2020-01-16 18:34:49,331 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3180 transitions. Word has length 25 [2020-01-16 18:34:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:49,331 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3180 transitions. [2020-01-16 18:34:49,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3180 transitions. [2020-01-16 18:34:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:49,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:49,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:49,333 INFO L426 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -187857067, now seen corresponding path program 408 times [2020-01-16 18:34:49,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:49,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982758261] [2020-01-16 18:34:49,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:49,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982758261] [2020-01-16 18:34:49,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:49,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:49,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938620828] [2020-01-16 18:34:49,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:49,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:49,747 INFO L87 Difference]: Start difference. First operand 810 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:34:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:49,897 INFO L93 Difference]: Finished difference Result 1505 states and 5178 transitions. [2020-01-16 18:34:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:49,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:49,900 INFO L225 Difference]: With dead ends: 1505 [2020-01-16 18:34:49,901 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:34:49,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:34:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 785. [2020-01-16 18:34:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:34:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3128 transitions. [2020-01-16 18:34:49,922 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3128 transitions. Word has length 25 [2020-01-16 18:34:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:49,923 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3128 transitions. [2020-01-16 18:34:49,923 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3128 transitions. [2020-01-16 18:34:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:49,924 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:49,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:49,924 INFO L426 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -327140489, now seen corresponding path program 409 times [2020-01-16 18:34:49,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:49,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722272856] [2020-01-16 18:34:49,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:50,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722272856] [2020-01-16 18:34:50,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:50,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:50,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514524029] [2020-01-16 18:34:50,310 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:50,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:50,310 INFO L87 Difference]: Start difference. First operand 785 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:34:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:50,471 INFO L93 Difference]: Finished difference Result 1456 states and 5096 transitions. [2020-01-16 18:34:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:50,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:50,475 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:34:50,475 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:34:50,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:34:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 798. [2020-01-16 18:34:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3173 transitions. [2020-01-16 18:34:50,497 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3173 transitions. Word has length 25 [2020-01-16 18:34:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:50,498 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3173 transitions. [2020-01-16 18:34:50,498 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3173 transitions. [2020-01-16 18:34:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:50,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:50,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:50,499 INFO L426 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 643111125, now seen corresponding path program 410 times [2020-01-16 18:34:50,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:50,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832278531] [2020-01-16 18:34:50,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:50,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832278531] [2020-01-16 18:34:50,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:50,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:50,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638576002] [2020-01-16 18:34:50,882 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:50,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:50,882 INFO L87 Difference]: Start difference. First operand 798 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:34:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:51,025 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:34:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:51,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:51,028 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:34:51,029 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:34:51,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:34:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 794. [2020-01-16 18:34:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:34:51,051 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:34:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:51,051 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:34:51,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:34:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:51,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:51,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:51,052 INFO L426 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1155994449, now seen corresponding path program 411 times [2020-01-16 18:34:51,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:51,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023251355] [2020-01-16 18:34:51,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:51,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023251355] [2020-01-16 18:34:51,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:51,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:51,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918820672] [2020-01-16 18:34:51,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:51,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:51,444 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:34:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:51,602 INFO L93 Difference]: Finished difference Result 1455 states and 5090 transitions. [2020-01-16 18:34:51,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:51,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:51,606 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:34:51,606 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:34:51,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:34:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 798. [2020-01-16 18:34:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:34:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-01-16 18:34:51,627 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-01-16 18:34:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:51,627 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-01-16 18:34:51,627 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-01-16 18:34:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:51,628 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:51,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:51,628 INFO L426 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2137211921, now seen corresponding path program 412 times [2020-01-16 18:34:51,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:51,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581348011] [2020-01-16 18:34:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:52,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581348011] [2020-01-16 18:34:52,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:52,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:52,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370218298] [2020-01-16 18:34:52,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:52,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:52,016 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:34:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:52,160 INFO L93 Difference]: Finished difference Result 1456 states and 5088 transitions. [2020-01-16 18:34:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:52,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:52,163 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:34:52,163 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:34:52,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:34:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-01-16 18:34:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:34:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-01-16 18:34:52,184 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-01-16 18:34:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:52,184 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-01-16 18:34:52,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-01-16 18:34:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:52,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:52,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:52,186 INFO L426 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1632928759, now seen corresponding path program 413 times [2020-01-16 18:34:52,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:52,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716558133] [2020-01-16 18:34:52,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:52,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-01-16 18:34:52,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716558133] [2020-01-16 18:34:52,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:52,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:52,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606188355] [2020-01-16 18:34:52,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:52,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:52,576 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:34:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:52,718 INFO L93 Difference]: Finished difference Result 1460 states and 5097 transitions. [2020-01-16 18:34:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:52,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:52,722 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:34:52,722 INFO L226 Difference]: Without dead ends: 1445 [2020-01-16 18:34:52,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-01-16 18:34:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 799. [2020-01-16 18:34:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:34:52,744 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:34:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:52,744 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:34:52,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:34:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:52,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:52,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:52,745 INFO L426 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2124182959, now seen corresponding path program 414 times [2020-01-16 18:34:52,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:52,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754424089] [2020-01-16 18:34:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:53,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754424089] [2020-01-16 18:34:53,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:53,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:53,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334405805] [2020-01-16 18:34:53,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:53,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:53,134 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:34:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:53,265 INFO L93 Difference]: Finished difference Result 1459 states and 5090 transitions. [2020-01-16 18:34:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:53,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:53,269 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:34:53,269 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:34:53,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:34:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 790. [2020-01-16 18:34:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-01-16 18:34:53,290 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-01-16 18:34:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:53,290 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-01-16 18:34:53,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-01-16 18:34:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:53,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:53,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:53,292 INFO L426 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -749626215, now seen corresponding path program 415 times [2020-01-16 18:34:53,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:53,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736774066] [2020-01-16 18:34:53,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:53,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736774066] [2020-01-16 18:34:53,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:53,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:53,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122379755] [2020-01-16 18:34:53,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:53,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:53,669 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:34:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:53,792 INFO L93 Difference]: Finished difference Result 1464 states and 5109 transitions. [2020-01-16 18:34:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:53,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:53,796 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:34:53,796 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:34:53,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:34:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-01-16 18:34:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3172 transitions. [2020-01-16 18:34:53,818 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3172 transitions. Word has length 25 [2020-01-16 18:34:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:53,818 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3172 transitions. [2020-01-16 18:34:53,818 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3172 transitions. [2020-01-16 18:34:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:53,819 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:53,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:53,819 INFO L426 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash 220625399, now seen corresponding path program 416 times [2020-01-16 18:34:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541038808] [2020-01-16 18:34:53,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:54,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541038808] [2020-01-16 18:34:54,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:54,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:54,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046809440] [2020-01-16 18:34:54,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:54,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:54,201 INFO L87 Difference]: Start difference. First operand 799 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:34:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:54,340 INFO L93 Difference]: Finished difference Result 1466 states and 5109 transitions. [2020-01-16 18:34:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:54,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:54,343 INFO L225 Difference]: With dead ends: 1466 [2020-01-16 18:34:54,344 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:34:54,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:34:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-01-16 18:34:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-01-16 18:34:54,365 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-01-16 18:34:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:54,366 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-01-16 18:34:54,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-01-16 18:34:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:54,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:54,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:54,367 INFO L426 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1635424495, now seen corresponding path program 417 times [2020-01-16 18:34:54,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:54,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806123500] [2020-01-16 18:34:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:54,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-01-16 18:34:54,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806123500] [2020-01-16 18:34:54,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:54,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:54,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221249105] [2020-01-16 18:34:54,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:54,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:54,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:54,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:54,779 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:34:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:54,913 INFO L93 Difference]: Finished difference Result 1468 states and 5112 transitions. [2020-01-16 18:34:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:54,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:54,917 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:34:54,917 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:34:54,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:34:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 800. [2020-01-16 18:34:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:34:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3170 transitions. [2020-01-16 18:34:54,939 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3170 transitions. Word has length 25 [2020-01-16 18:34:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:54,939 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3170 transitions. [2020-01-16 18:34:54,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3170 transitions. [2020-01-16 18:34:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:54,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:54,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:54,941 INFO L426 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -623160465, now seen corresponding path program 418 times [2020-01-16 18:34:54,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:54,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008993418] [2020-01-16 18:34:54,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:55,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008993418] [2020-01-16 18:34:55,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:55,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:55,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709688085] [2020-01-16 18:34:55,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:55,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:55,345 INFO L87 Difference]: Start difference. First operand 800 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:34:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:55,476 INFO L93 Difference]: Finished difference Result 1473 states and 5117 transitions. [2020-01-16 18:34:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:55,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:55,480 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:34:55,480 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:34:55,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:34:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2020-01-16 18:34:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:34:55,501 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:34:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:55,501 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:34:55,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:34:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:55,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:55,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:55,503 INFO L426 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1536039257, now seen corresponding path program 419 times [2020-01-16 18:34:55,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:55,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449244680] [2020-01-16 18:34:55,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:55,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449244680] [2020-01-16 18:34:55,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:55,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:55,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541234762] [2020-01-16 18:34:55,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:55,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:55,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:55,892 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:34:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:56,028 INFO L93 Difference]: Finished difference Result 1474 states and 5121 transitions. [2020-01-16 18:34:56,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:56,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:56,031 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:34:56,032 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:34:56,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:34:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 802. [2020-01-16 18:34:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:34:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3169 transitions. [2020-01-16 18:34:56,054 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3169 transitions. Word has length 25 [2020-01-16 18:34:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:56,054 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3169 transitions. [2020-01-16 18:34:56,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3169 transitions. [2020-01-16 18:34:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:56,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:56,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:56,056 INFO L426 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash -610131503, now seen corresponding path program 420 times [2020-01-16 18:34:56,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:56,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682053512] [2020-01-16 18:34:56,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:56,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682053512] [2020-01-16 18:34:56,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:56,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:56,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820384628] [2020-01-16 18:34:56,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:56,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:56,442 INFO L87 Difference]: Start difference. First operand 802 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:34:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:56,562 INFO L93 Difference]: Finished difference Result 1477 states and 5120 transitions. [2020-01-16 18:34:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:56,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:56,566 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:34:56,566 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:34:56,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:34:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 790. [2020-01-16 18:34:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3142 transitions. [2020-01-16 18:34:56,588 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3142 transitions. Word has length 25 [2020-01-16 18:34:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:56,588 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3142 transitions. [2020-01-16 18:34:56,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3142 transitions. [2020-01-16 18:34:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:56,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:56,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:56,589 INFO L426 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash -533948455, now seen corresponding path program 421 times [2020-01-16 18:34:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724523901] [2020-01-16 18:34:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724523901] [2020-01-16 18:34:56,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:56,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:56,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986025794] [2020-01-16 18:34:56,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:56,976 INFO L87 Difference]: Start difference. First operand 790 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:34:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:57,110 INFO L93 Difference]: Finished difference Result 1461 states and 5097 transitions. [2020-01-16 18:34:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:57,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:57,114 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:34:57,114 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:34:57,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:34:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 799. [2020-01-16 18:34:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:34:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:34:57,135 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:34:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:57,135 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:34:57,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:34:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:57,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:57,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:57,137 INFO L426 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 467812471, now seen corresponding path program 422 times [2020-01-16 18:34:57,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:57,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977770707] [2020-01-16 18:34:57,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:57,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977770707] [2020-01-16 18:34:57,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:57,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:57,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628900693] [2020-01-16 18:34:57,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:57,523 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:34:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:57,666 INFO L93 Difference]: Finished difference Result 1462 states and 5095 transitions. [2020-01-16 18:34:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:57,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:57,669 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:34:57,670 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:34:57,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:34:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 795. [2020-01-16 18:34:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:34:57,691 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:34:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:57,691 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:34:57,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:34:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:57,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:57,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:57,692 INFO L426 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1392085623, now seen corresponding path program 423 times [2020-01-16 18:34:57,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:57,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109306206] [2020-01-16 18:34:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:58,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-01-16 18:34:58,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109306206] [2020-01-16 18:34:58,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:58,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:58,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289244206] [2020-01-16 18:34:58,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:58,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:58,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:58,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:58,076 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:34:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:58,204 INFO L93 Difference]: Finished difference Result 1466 states and 5102 transitions. [2020-01-16 18:34:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:58,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:58,208 INFO L225 Difference]: With dead ends: 1466 [2020-01-16 18:34:58,208 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:34:58,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:34:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-01-16 18:34:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:34:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-01-16 18:34:58,232 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-01-16 18:34:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:58,232 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-01-16 18:34:58,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-01-16 18:34:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:58,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:58,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:58,233 INFO L426 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1890617643, now seen corresponding path program 424 times [2020-01-16 18:34:58,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:58,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014667008] [2020-01-16 18:34:58,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:58,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-01-16 18:34:58,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014667008] [2020-01-16 18:34:58,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:58,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:58,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226391722] [2020-01-16 18:34:58,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:58,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:58,641 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:34:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:58,749 INFO L93 Difference]: Finished difference Result 1471 states and 5107 transitions. [2020-01-16 18:34:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:58,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:58,752 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:34:58,753 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:34:58,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:34:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 795. [2020-01-16 18:34:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:34:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:34:58,774 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:34:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:58,774 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:34:58,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:34:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:58,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:58,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:58,775 INFO L426 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1783226329, now seen corresponding path program 425 times [2020-01-16 18:34:58,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508229610] [2020-01-16 18:34:58,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:59,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508229610] [2020-01-16 18:34:59,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:59,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:59,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229037995] [2020-01-16 18:34:59,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:59,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:59,158 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:34:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:59,309 INFO L93 Difference]: Finished difference Result 1469 states and 5104 transitions. [2020-01-16 18:34:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:59,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:59,312 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:34:59,312 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:34:59,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:34:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 801. [2020-01-16 18:34:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:34:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-01-16 18:34:59,333 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-01-16 18:34:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:59,334 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-01-16 18:34:59,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-01-16 18:34:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:59,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:59,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:59,335 INFO L426 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash -900800009, now seen corresponding path program 426 times [2020-01-16 18:34:59,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:59,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415230913] [2020-01-16 18:34:59,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:59,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415230913] [2020-01-16 18:34:59,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:59,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:34:59,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637541005] [2020-01-16 18:34:59,719 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:34:59,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:34:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:34:59,720 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:34:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:59,823 INFO L93 Difference]: Finished difference Result 1473 states and 5106 transitions. [2020-01-16 18:34:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:34:59,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:34:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:59,826 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:34:59,826 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:34:59,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:34:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:34:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 790. [2020-01-16 18:34:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:34:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-01-16 18:34:59,847 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-01-16 18:34:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:59,847 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-01-16 18:34:59,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:34:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-01-16 18:34:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:34:59,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:59,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:59,848 INFO L426 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:34:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -538914603, now seen corresponding path program 427 times [2020-01-16 18:34:59,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:59,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819668838] [2020-01-16 18:34:59,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:00,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819668838] [2020-01-16 18:35:00,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:00,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:00,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602859058] [2020-01-16 18:35:00,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:00,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:00,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:00,239 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:35:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:00,387 INFO L93 Difference]: Finished difference Result 1472 states and 5120 transitions. [2020-01-16 18:35:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:00,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:00,391 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:35:00,391 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:35:00,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:35:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 801. [2020-01-16 18:35:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3168 transitions. [2020-01-16 18:35:00,413 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3168 transitions. Word has length 25 [2020-01-16 18:35:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:00,413 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3168 transitions. [2020-01-16 18:35:00,413 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3168 transitions. [2020-01-16 18:35:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:00,414 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:00,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:00,415 INFO L426 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1059025, now seen corresponding path program 428 times [2020-01-16 18:35:00,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:00,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832269939] [2020-01-16 18:35:00,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:00,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832269939] [2020-01-16 18:35:00,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:00,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:00,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495077774] [2020-01-16 18:35:00,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:00,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:00,806 INFO L87 Difference]: Start difference. First operand 801 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:35:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:00,941 INFO L93 Difference]: Finished difference Result 1471 states and 5113 transitions. [2020-01-16 18:35:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:00,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:00,944 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:35:00,944 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:35:00,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:35:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 796. [2020-01-16 18:35:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:35:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-01-16 18:35:00,966 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-01-16 18:35:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:00,966 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-01-16 18:35:00,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-01-16 18:35:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:00,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:00,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:00,968 INFO L426 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2139352457, now seen corresponding path program 429 times [2020-01-16 18:35:00,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:00,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799652116] [2020-01-16 18:35:00,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:01,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799652116] [2020-01-16 18:35:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:01,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:01,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041018795] [2020-01-16 18:35:01,357 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:01,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:01,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:01,357 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:35:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:01,499 INFO L93 Difference]: Finished difference Result 1478 states and 5127 transitions. [2020-01-16 18:35:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:01,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:01,503 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:35:01,503 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:35:01,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:35:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 803. [2020-01-16 18:35:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:35:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-01-16 18:35:01,524 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-01-16 18:35:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:01,524 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-01-16 18:35:01,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-01-16 18:35:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:01,525 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:01,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:01,526 INFO L426 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 9444079, now seen corresponding path program 430 times [2020-01-16 18:35:01,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:01,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073923988] [2020-01-16 18:35:01,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:01,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073923988] [2020-01-16 18:35:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:01,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:01,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499923483] [2020-01-16 18:35:01,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:01,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:01,931 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:35:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:02,045 INFO L93 Difference]: Finished difference Result 1481 states and 5126 transitions. [2020-01-16 18:35:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:02,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:02,048 INFO L225 Difference]: With dead ends: 1481 [2020-01-16 18:35:02,048 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:35:02,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:35:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 796. [2020-01-16 18:35:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:35:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:35:02,070 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:35:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:02,071 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:35:02,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:35:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:02,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:02,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:02,072 INFO L426 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2107843145, now seen corresponding path program 431 times [2020-01-16 18:35:02,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:02,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476683229] [2020-01-16 18:35:02,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:02,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476683229] [2020-01-16 18:35:02,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:02,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:02,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078319893] [2020-01-16 18:35:02,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:02,472 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:35:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:02,598 INFO L93 Difference]: Finished difference Result 1475 states and 5114 transitions. [2020-01-16 18:35:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:02,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:02,602 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:35:02,602 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:35:02,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:35:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-01-16 18:35:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:35:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-01-16 18:35:02,630 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-01-16 18:35:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:02,630 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-01-16 18:35:02,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-01-16 18:35:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:02,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:02,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:02,632 INFO L426 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash -496902187, now seen corresponding path program 432 times [2020-01-16 18:35:02,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:02,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211321837] [2020-01-16 18:35:02,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:03,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211321837] [2020-01-16 18:35:03,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:03,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:03,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227927962] [2020-01-16 18:35:03,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:03,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:03,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:03,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:03,034 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:35:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:03,150 INFO L93 Difference]: Finished difference Result 1479 states and 5116 transitions. [2020-01-16 18:35:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:03,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:03,154 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:35:03,154 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:35:03,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:35:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 785. [2020-01-16 18:35:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:35:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3123 transitions. [2020-01-16 18:35:03,175 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3123 transitions. Word has length 25 [2020-01-16 18:35:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:03,176 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3123 transitions. [2020-01-16 18:35:03,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3123 transitions. [2020-01-16 18:35:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:03,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:03,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:03,177 INFO L426 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2039322317, now seen corresponding path program 433 times [2020-01-16 18:35:03,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:03,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108532676] [2020-01-16 18:35:03,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:03,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-01-16 18:35:03,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108532676] [2020-01-16 18:35:03,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:03,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:03,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782876931] [2020-01-16 18:35:03,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:03,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:03,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:03,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:03,561 INFO L87 Difference]: Start difference. First operand 785 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:35:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:03,714 INFO L93 Difference]: Finished difference Result 1464 states and 5108 transitions. [2020-01-16 18:35:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:03,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:03,718 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:35:03,718 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:35:03,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:35:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-01-16 18:35:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:35:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3171 transitions. [2020-01-16 18:35:03,740 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3171 transitions. Word has length 25 [2020-01-16 18:35:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:03,741 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3171 transitions. [2020-01-16 18:35:03,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3171 transitions. [2020-01-16 18:35:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:03,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:03,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:03,742 INFO L426 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1048064495, now seen corresponding path program 434 times [2020-01-16 18:35:03,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:03,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081426045] [2020-01-16 18:35:03,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081426045] [2020-01-16 18:35:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:04,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:04,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747232047] [2020-01-16 18:35:04,130 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:04,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:04,130 INFO L87 Difference]: Start difference. First operand 799 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:35:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:04,296 INFO L93 Difference]: Finished difference Result 1467 states and 5110 transitions. [2020-01-16 18:35:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:04,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:04,301 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:35:04,301 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:35:04,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:35:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-01-16 18:35:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:35:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3160 transitions. [2020-01-16 18:35:04,326 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3160 transitions. Word has length 25 [2020-01-16 18:35:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:04,326 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3160 transitions. [2020-01-16 18:35:04,326 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3160 transitions. [2020-01-16 18:35:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:04,327 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:04,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:04,328 INFO L426 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash -113288239, now seen corresponding path program 435 times [2020-01-16 18:35:04,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:04,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549949656] [2020-01-16 18:35:04,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:04,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-01-16 18:35:04,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549949656] [2020-01-16 18:35:04,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:04,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:04,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051913952] [2020-01-16 18:35:04,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:04,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:04,724 INFO L87 Difference]: Start difference. First operand 795 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:35:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:04,891 INFO L93 Difference]: Finished difference Result 1462 states and 5100 transitions. [2020-01-16 18:35:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:04,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:04,895 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:35:04,895 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:35:04,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:35:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 799. [2020-01-16 18:35:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:35:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:35:04,920 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:35:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:04,920 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:35:04,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:35:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:04,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:04,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:04,922 INFO L426 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 888472687, now seen corresponding path program 436 times [2020-01-16 18:35:04,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:04,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415991774] [2020-01-16 18:35:04,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:05,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415991774] [2020-01-16 18:35:05,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:05,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:05,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066479380] [2020-01-16 18:35:05,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:05,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:05,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:05,326 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:35:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:05,498 INFO L93 Difference]: Finished difference Result 1463 states and 5098 transitions. [2020-01-16 18:35:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:05,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:05,501 INFO L225 Difference]: With dead ends: 1463 [2020-01-16 18:35:05,501 INFO L226 Difference]: Without dead ends: 1445 [2020-01-16 18:35:05,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-01-16 18:35:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 795. [2020-01-16 18:35:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:35:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:35:05,522 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:35:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:05,522 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:35:05,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:35:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:05,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:05,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:05,523 INFO L426 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -58246861, now seen corresponding path program 437 times [2020-01-16 18:35:05,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:05,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684443062] [2020-01-16 18:35:05,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:05,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684443062] [2020-01-16 18:35:05,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:05,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:05,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840519760] [2020-01-16 18:35:05,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:05,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:05,905 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:35:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:06,034 INFO L93 Difference]: Finished difference Result 1469 states and 5111 transitions. [2020-01-16 18:35:06,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:06,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:06,037 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:35:06,037 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:35:06,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:35:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-01-16 18:35:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:35:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-01-16 18:35:06,061 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-01-16 18:35:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:06,061 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-01-16 18:35:06,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-01-16 18:35:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:06,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:06,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:06,062 INFO L426 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1552694097, now seen corresponding path program 438 times [2020-01-16 18:35:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:06,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652450258] [2020-01-16 18:35:06,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:06,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652450258] [2020-01-16 18:35:06,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:06,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:06,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478328911] [2020-01-16 18:35:06,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:06,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:06,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:06,445 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:35:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:06,591 INFO L93 Difference]: Finished difference Result 1467 states and 5102 transitions. [2020-01-16 18:35:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:06,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:06,594 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:35:06,594 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:35:06,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:35:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 791. [2020-01-16 18:35:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:35:06,616 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:06,616 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:35:06,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:35:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:06,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:06,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:06,617 INFO L426 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1833159253, now seen corresponding path program 439 times [2020-01-16 18:35:06,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:06,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108948257] [2020-01-16 18:35:06,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:07,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108948257] [2020-01-16 18:35:07,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:07,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:07,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141240227] [2020-01-16 18:35:07,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:07,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:07,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:07,002 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:07,139 INFO L93 Difference]: Finished difference Result 1475 states and 5127 transitions. [2020-01-16 18:35:07,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:07,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:07,143 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:35:07,143 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:35:07,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:35:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 801. [2020-01-16 18:35:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3172 transitions. [2020-01-16 18:35:07,164 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3172 transitions. Word has length 25 [2020-01-16 18:35:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:07,165 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3172 transitions. [2020-01-16 18:35:07,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3172 transitions. [2020-01-16 18:35:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:07,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:07,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:07,166 INFO L426 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1470550221, now seen corresponding path program 440 times [2020-01-16 18:35:07,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:07,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199442212] [2020-01-16 18:35:07,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:07,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199442212] [2020-01-16 18:35:07,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:07,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:07,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487143424] [2020-01-16 18:35:07,558 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:07,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:07,559 INFO L87 Difference]: Start difference. First operand 801 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:35:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:07,696 INFO L93 Difference]: Finished difference Result 1478 states and 5129 transitions. [2020-01-16 18:35:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:07,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:07,700 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:35:07,700 INFO L226 Difference]: Without dead ends: 1458 [2020-01-16 18:35:07,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-01-16 18:35:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 797. [2020-01-16 18:35:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:35:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:35:07,721 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:35:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:07,721 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:35:07,721 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:35:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:07,722 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:07,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:07,723 INFO L426 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1390260113, now seen corresponding path program 441 times [2020-01-16 18:35:07,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:07,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549261339] [2020-01-16 18:35:07,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:08,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549261339] [2020-01-16 18:35:08,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:08,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:08,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678066090] [2020-01-16 18:35:08,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:08,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:08,107 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:35:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:08,273 INFO L93 Difference]: Finished difference Result 1478 states and 5128 transitions. [2020-01-16 18:35:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:08,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:08,277 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:35:08,277 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:35:08,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:35:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 802. [2020-01-16 18:35:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:35:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3170 transitions. [2020-01-16 18:35:08,323 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3170 transitions. Word has length 25 [2020-01-16 18:35:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:08,323 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3170 transitions. [2020-01-16 18:35:08,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3170 transitions. [2020-01-16 18:35:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:08,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:08,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:08,324 INFO L426 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1892443153, now seen corresponding path program 442 times [2020-01-16 18:35:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:08,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916590510] [2020-01-16 18:35:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:08,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-01-16 18:35:08,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916590510] [2020-01-16 18:35:08,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:08,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:08,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131515178] [2020-01-16 18:35:08,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:08,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:08,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:08,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:08,706 INFO L87 Difference]: Start difference. First operand 802 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:35:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:08,818 INFO L93 Difference]: Finished difference Result 1483 states and 5133 transitions. [2020-01-16 18:35:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:08,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:08,821 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:35:08,822 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:35:08,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:35:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 797. [2020-01-16 18:35:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:35:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-01-16 18:35:08,842 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-01-16 18:35:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:08,843 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-01-16 18:35:08,843 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-01-16 18:35:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:08,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:08,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:08,844 INFO L426 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -155136363, now seen corresponding path program 443 times [2020-01-16 18:35:08,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:08,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025157269] [2020-01-16 18:35:08,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:09,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025157269] [2020-01-16 18:35:09,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:09,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:09,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519096241] [2020-01-16 18:35:09,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:09,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:09,240 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:35:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:09,385 INFO L93 Difference]: Finished difference Result 1488 states and 5145 transitions. [2020-01-16 18:35:09,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:09,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:09,389 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:35:09,389 INFO L226 Difference]: Without dead ends: 1472 [2020-01-16 18:35:09,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2020-01-16 18:35:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 806. [2020-01-16 18:35:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:35:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3172 transitions. [2020-01-16 18:35:09,410 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3172 transitions. Word has length 25 [2020-01-16 18:35:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:09,410 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3172 transitions. [2020-01-16 18:35:09,410 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3172 transitions. [2020-01-16 18:35:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:09,411 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:09,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:09,411 INFO L426 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1228221743, now seen corresponding path program 444 times [2020-01-16 18:35:09,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:09,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992014776] [2020-01-16 18:35:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:09,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-01-16 18:35:09,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992014776] [2020-01-16 18:35:09,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:09,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:09,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027329783] [2020-01-16 18:35:09,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:09,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:09,815 INFO L87 Difference]: Start difference. First operand 806 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:35:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:09,955 INFO L93 Difference]: Finished difference Result 1490 states and 5141 transitions. [2020-01-16 18:35:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:09,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:09,959 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:35:09,959 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:35:09,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:35:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 791. [2020-01-16 18:35:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-01-16 18:35:09,980 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-01-16 18:35:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:09,980 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-01-16 18:35:09,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-01-16 18:35:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:09,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:09,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:09,982 INFO L426 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash -958259691, now seen corresponding path program 445 times [2020-01-16 18:35:09,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:09,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943240331] [2020-01-16 18:35:09,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:10,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943240331] [2020-01-16 18:35:10,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:10,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:10,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837275050] [2020-01-16 18:35:10,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:10,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:10,396 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:35:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:10,560 INFO L93 Difference]: Finished difference Result 1467 states and 5104 transitions. [2020-01-16 18:35:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:10,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:10,563 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:35:10,564 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:35:10,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:35:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 800. [2020-01-16 18:35:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:35:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3164 transitions. [2020-01-16 18:35:10,585 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3164 transitions. Word has length 25 [2020-01-16 18:35:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:10,586 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3164 transitions. [2020-01-16 18:35:10,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3164 transitions. [2020-01-16 18:35:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:10,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:10,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:10,587 INFO L426 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash 43501235, now seen corresponding path program 446 times [2020-01-16 18:35:10,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:10,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222126029] [2020-01-16 18:35:10,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:10,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-01-16 18:35:10,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222126029] [2020-01-16 18:35:10,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:10,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:10,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897364975] [2020-01-16 18:35:10,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:10,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:10,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:10,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:10,980 INFO L87 Difference]: Start difference. First operand 800 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:35:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:11,130 INFO L93 Difference]: Finished difference Result 1468 states and 5102 transitions. [2020-01-16 18:35:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:11,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:11,134 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:35:11,134 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:35:11,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:35:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 796. [2020-01-16 18:35:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:35:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-01-16 18:35:11,156 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-01-16 18:35:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:11,156 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-01-16 18:35:11,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-01-16 18:35:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:11,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:11,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:11,158 INFO L426 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 967774387, now seen corresponding path program 447 times [2020-01-16 18:35:11,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:11,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626839641] [2020-01-16 18:35:11,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:11,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626839641] [2020-01-16 18:35:11,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:11,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614450281] [2020-01-16 18:35:11,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:11,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:11,546 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:35:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:11,707 INFO L93 Difference]: Finished difference Result 1472 states and 5109 transitions. [2020-01-16 18:35:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:11,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:11,711 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:35:11,711 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:35:11,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:35:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 801. [2020-01-16 18:35:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-01-16 18:35:11,733 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-01-16 18:35:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:11,733 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-01-16 18:35:11,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-01-16 18:35:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:11,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:11,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:11,734 INFO L426 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1980038417, now seen corresponding path program 448 times [2020-01-16 18:35:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:11,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958668076] [2020-01-16 18:35:11,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:12,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-01-16 18:35:12,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958668076] [2020-01-16 18:35:12,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:12,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:12,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605791270] [2020-01-16 18:35:12,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:12,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:12,126 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:35:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:12,271 INFO L93 Difference]: Finished difference Result 1477 states and 5114 transitions. [2020-01-16 18:35:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:12,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:12,274 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:35:12,274 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:35:12,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:35:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-01-16 18:35:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:35:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:35:12,295 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:35:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:12,296 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:35:12,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:35:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:12,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:12,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:12,297 INFO L426 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1358915093, now seen corresponding path program 449 times [2020-01-16 18:35:12,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:12,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426738104] [2020-01-16 18:35:12,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:12,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-01-16 18:35:12,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426738104] [2020-01-16 18:35:12,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:12,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:12,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182939768] [2020-01-16 18:35:12,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:12,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:12,689 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:35:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:12,841 INFO L93 Difference]: Finished difference Result 1475 states and 5111 transitions. [2020-01-16 18:35:12,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:12,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:12,845 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:35:12,845 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:35:12,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:35:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-01-16 18:35:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:35:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-01-16 18:35:12,867 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-01-16 18:35:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:12,867 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-01-16 18:35:12,867 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-01-16 18:35:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:12,868 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:12,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:12,868 INFO L426 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1325111245, now seen corresponding path program 450 times [2020-01-16 18:35:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:12,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024150076] [2020-01-16 18:35:12,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:13,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024150076] [2020-01-16 18:35:13,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:13,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:13,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588605797] [2020-01-16 18:35:13,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:13,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:13,261 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:35:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:13,409 INFO L93 Difference]: Finished difference Result 1479 states and 5113 transitions. [2020-01-16 18:35:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:13,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:13,413 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:35:13,413 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:35:13,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:35:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 791. [2020-01-16 18:35:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-01-16 18:35:13,434 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-01-16 18:35:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:13,434 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-01-16 18:35:13,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-01-16 18:35:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:13,435 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:13,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:13,435 INFO L426 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2064877073, now seen corresponding path program 451 times [2020-01-16 18:35:13,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:13,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307310450] [2020-01-16 18:35:13,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:13,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-01-16 18:35:13,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307310450] [2020-01-16 18:35:13,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:13,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:13,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390829876] [2020-01-16 18:35:13,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:13,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:13,826 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:35:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:13,981 INFO L93 Difference]: Finished difference Result 1484 states and 5139 transitions. [2020-01-16 18:35:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:13,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:13,985 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:35:13,985 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:35:13,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:35:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 803. [2020-01-16 18:35:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:35:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-01-16 18:35:14,006 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-01-16 18:35:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:14,006 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-01-16 18:35:14,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-01-16 18:35:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:14,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:14,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:14,008 INFO L426 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -619149265, now seen corresponding path program 452 times [2020-01-16 18:35:14,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:14,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710492195] [2020-01-16 18:35:14,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:14,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710492195] [2020-01-16 18:35:14,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:14,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:14,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400914658] [2020-01-16 18:35:14,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:14,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:14,392 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:35:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:14,552 INFO L93 Difference]: Finished difference Result 1482 states and 5130 transitions. [2020-01-16 18:35:14,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:14,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:14,556 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:35:14,556 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:35:14,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:35:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 798. [2020-01-16 18:35:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:35:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3153 transitions. [2020-01-16 18:35:14,577 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3153 transitions. Word has length 25 [2020-01-16 18:35:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:14,577 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3153 transitions. [2020-01-16 18:35:14,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3153 transitions. [2020-01-16 18:35:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:14,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:14,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:14,578 INFO L426 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 464439219, now seen corresponding path program 453 times [2020-01-16 18:35:14,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:14,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386532833] [2020-01-16 18:35:14,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:14,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-01-16 18:35:14,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386532833] [2020-01-16 18:35:14,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:14,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:14,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364885040] [2020-01-16 18:35:14,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:14,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:14,979 INFO L87 Difference]: Start difference. First operand 798 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:35:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:15,145 INFO L93 Difference]: Finished difference Result 1492 states and 5150 transitions. [2020-01-16 18:35:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:15,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:15,149 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:35:15,149 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:35:15,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:35:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 807. [2020-01-16 18:35:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:35:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3169 transitions. [2020-01-16 18:35:15,171 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3169 transitions. Word has length 25 [2020-01-16 18:35:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:15,171 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3169 transitions. [2020-01-16 18:35:15,171 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3169 transitions. [2020-01-16 18:35:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:15,172 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:15,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:15,172 INFO L426 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash -608646161, now seen corresponding path program 454 times [2020-01-16 18:35:15,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:15,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484587642] [2020-01-16 18:35:15,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:15,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484587642] [2020-01-16 18:35:15,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:15,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:15,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703582960] [2020-01-16 18:35:15,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:15,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:15,573 INFO L87 Difference]: Start difference. First operand 807 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:35:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:15,709 INFO L93 Difference]: Finished difference Result 1494 states and 5146 transitions. [2020-01-16 18:35:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:15,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:15,713 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:35:15,713 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:35:15,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:35:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 798. [2020-01-16 18:35:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:35:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-01-16 18:35:15,734 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-01-16 18:35:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:15,734 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-01-16 18:35:15,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-01-16 18:35:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:15,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:15,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:15,736 INFO L426 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash 474942323, now seen corresponding path program 455 times [2020-01-16 18:35:15,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:15,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380309013] [2020-01-16 18:35:15,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:16,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-01-16 18:35:16,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380309013] [2020-01-16 18:35:16,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:16,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:16,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791935600] [2020-01-16 18:35:16,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:16,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:16,131 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:35:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:16,295 INFO L93 Difference]: Finished difference Result 1485 states and 5128 transitions. [2020-01-16 18:35:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:16,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:16,299 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:35:16,299 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:35:16,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:35:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-01-16 18:35:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:35:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3157 transitions. [2020-01-16 18:35:16,321 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3157 transitions. Word has length 25 [2020-01-16 18:35:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:16,321 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3157 transitions. [2020-01-16 18:35:16,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3157 transitions. [2020-01-16 18:35:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:16,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:16,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:16,322 INFO L426 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2085883281, now seen corresponding path program 456 times [2020-01-16 18:35:16,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:16,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493483770] [2020-01-16 18:35:16,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:16,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-01-16 18:35:16,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493483770] [2020-01-16 18:35:16,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:16,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:16,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718514834] [2020-01-16 18:35:16,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:16,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:16,723 INFO L87 Difference]: Start difference. First operand 804 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:35:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:16,849 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-01-16 18:35:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:16,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:16,852 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:35:16,852 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:35:16,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:35:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 785. [2020-01-16 18:35:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:35:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-01-16 18:35:16,874 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-01-16 18:35:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:16,874 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-01-16 18:35:16,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-01-16 18:35:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:16,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:16,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:16,875 INFO L426 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash -128929703, now seen corresponding path program 457 times [2020-01-16 18:35:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:16,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94897238] [2020-01-16 18:35:16,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:17,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94897238] [2020-01-16 18:35:17,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:17,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:17,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522208394] [2020-01-16 18:35:17,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:17,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:17,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:17,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:17,275 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:35:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:17,443 INFO L93 Difference]: Finished difference Result 1491 states and 5177 transitions. [2020-01-16 18:35:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:17,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:17,446 INFO L225 Difference]: With dead ends: 1491 [2020-01-16 18:35:17,446 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:35:17,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:35:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 805. [2020-01-16 18:35:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:35:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3181 transitions. [2020-01-16 18:35:17,468 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3181 transitions. Word has length 25 [2020-01-16 18:35:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:17,468 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3181 transitions. [2020-01-16 18:35:17,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3181 transitions. [2020-01-16 18:35:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:17,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:17,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:17,469 INFO L426 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1202015083, now seen corresponding path program 458 times [2020-01-16 18:35:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:17,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331270280] [2020-01-16 18:35:17,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:17,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331270280] [2020-01-16 18:35:17,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:17,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:17,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947654809] [2020-01-16 18:35:17,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:17,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:17,867 INFO L87 Difference]: Start difference. First operand 805 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:35:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:18,014 INFO L93 Difference]: Finished difference Result 1492 states and 5173 transitions. [2020-01-16 18:35:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:18,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:18,017 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:35:18,018 INFO L226 Difference]: Without dead ends: 1470 [2020-01-16 18:35:18,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-01-16 18:35:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 799. [2020-01-16 18:35:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:35:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3165 transitions. [2020-01-16 18:35:18,039 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3165 transitions. Word has length 25 [2020-01-16 18:35:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:18,039 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3165 transitions. [2020-01-16 18:35:18,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3165 transitions. [2020-01-16 18:35:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:18,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:18,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:18,040 INFO L426 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367557, now seen corresponding path program 459 times [2020-01-16 18:35:18,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:18,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079659387] [2020-01-16 18:35:18,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:18,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079659387] [2020-01-16 18:35:18,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:18,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:18,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320303631] [2020-01-16 18:35:18,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:18,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:18,448 INFO L87 Difference]: Start difference. First operand 799 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:35:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:18,589 INFO L93 Difference]: Finished difference Result 1488 states and 5165 transitions. [2020-01-16 18:35:18,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:18,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:18,593 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:35:18,593 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:35:18,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:35:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 804. [2020-01-16 18:35:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:35:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-01-16 18:35:18,615 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-01-16 18:35:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:18,615 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-01-16 18:35:18,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-01-16 18:35:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:18,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:18,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:18,616 INFO L426 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1191511979, now seen corresponding path program 460 times [2020-01-16 18:35:18,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:18,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029607792] [2020-01-16 18:35:18,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:19,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-01-16 18:35:19,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029607792] [2020-01-16 18:35:19,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:19,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:19,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454320333] [2020-01-16 18:35:19,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:19,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:19,006 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:35:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:19,137 INFO L93 Difference]: Finished difference Result 1487 states and 5158 transitions. [2020-01-16 18:35:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:19,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:19,140 INFO L225 Difference]: With dead ends: 1487 [2020-01-16 18:35:19,140 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:35:19,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:35:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 799. [2020-01-16 18:35:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:35:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3160 transitions. [2020-01-16 18:35:19,161 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3160 transitions. Word has length 25 [2020-01-16 18:35:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:19,162 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3160 transitions. [2020-01-16 18:35:19,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3160 transitions. [2020-01-16 18:35:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:19,163 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:19,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:19,163 INFO L426 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1708361349, now seen corresponding path program 461 times [2020-01-16 18:35:19,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:19,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196101919] [2020-01-16 18:35:19,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:19,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-01-16 18:35:19,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196101919] [2020-01-16 18:35:19,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:19,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622791561] [2020-01-16 18:35:19,550 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:19,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:19,551 INFO L87 Difference]: Start difference. First operand 799 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:35:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:19,702 INFO L93 Difference]: Finished difference Result 1490 states and 5164 transitions. [2020-01-16 18:35:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:19,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:19,706 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:35:19,706 INFO L226 Difference]: Without dead ends: 1474 [2020-01-16 18:35:19,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-01-16 18:35:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 804. [2020-01-16 18:35:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:35:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3169 transitions. [2020-01-16 18:35:19,728 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3169 transitions. Word has length 25 [2020-01-16 18:35:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:19,728 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3169 transitions. [2020-01-16 18:35:19,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3169 transitions. [2020-01-16 18:35:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:19,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:19,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:19,729 INFO L426 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash -97420391, now seen corresponding path program 462 times [2020-01-16 18:35:19,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:19,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610387199] [2020-01-16 18:35:19,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610387199] [2020-01-16 18:35:20,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:20,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:20,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576293285] [2020-01-16 18:35:20,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:20,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:20,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:20,120 INFO L87 Difference]: Start difference. First operand 804 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:35:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:20,257 INFO L93 Difference]: Finished difference Result 1488 states and 5155 transitions. [2020-01-16 18:35:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:20,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:20,261 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:35:20,261 INFO L226 Difference]: Without dead ends: 1464 [2020-01-16 18:35:20,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-01-16 18:35:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 794. [2020-01-16 18:35:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:35:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:35:20,285 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:35:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:20,285 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:35:20,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:35:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:20,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:20,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:20,287 INFO L426 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1797104375, now seen corresponding path program 463 times [2020-01-16 18:35:20,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:20,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933413917] [2020-01-16 18:35:20,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:20,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933413917] [2020-01-16 18:35:20,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:20,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:20,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912750498] [2020-01-16 18:35:20,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:20,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:20,686 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:35:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:20,826 INFO L93 Difference]: Finished difference Result 1505 states and 5203 transitions. [2020-01-16 18:35:20,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:20,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:20,830 INFO L225 Difference]: With dead ends: 1505 [2020-01-16 18:35:20,830 INFO L226 Difference]: Without dead ends: 1490 [2020-01-16 18:35:20,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-01-16 18:35:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 809. [2020-01-16 18:35:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-01-16 18:35:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 3186 transitions. [2020-01-16 18:35:20,852 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 3186 transitions. Word has length 25 [2020-01-16 18:35:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:20,853 INFO L478 AbstractCegarLoop]: Abstraction has 809 states and 3186 transitions. [2020-01-16 18:35:20,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 3186 transitions. [2020-01-16 18:35:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:20,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:20,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] [2020-01-16 18:35:20,854 INFO L426 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash 724018995, now seen corresponding path program 464 times [2020-01-16 18:35:20,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:20,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752727220] [2020-01-16 18:35:20,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752727220] [2020-01-16 18:35:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967836491] [2020-01-16 18:35:21,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:21,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:21,259 INFO L87 Difference]: Start difference. First operand 809 states and 3186 transitions. Second operand 10 states. [2020-01-16 18:35:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:21,407 INFO L93 Difference]: Finished difference Result 1506 states and 5199 transitions. [2020-01-16 18:35:21,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:21,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:21,411 INFO L225 Difference]: With dead ends: 1506 [2020-01-16 18:35:21,411 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:35:21,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:35:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 803. [2020-01-16 18:35:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:35:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3169 transitions. [2020-01-16 18:35:21,433 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3169 transitions. Word has length 25 [2020-01-16 18:35:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:21,433 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3169 transitions. [2020-01-16 18:35:21,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3169 transitions. [2020-01-16 18:35:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:21,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:21,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:21,434 INFO L426 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1403771333, now seen corresponding path program 465 times [2020-01-16 18:35:21,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:21,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34933378] [2020-01-16 18:35:21,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:21,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34933378] [2020-01-16 18:35:21,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:21,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:21,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297836789] [2020-01-16 18:35:21,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:21,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:21,838 INFO L87 Difference]: Start difference. First operand 803 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:35:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:21,978 INFO L93 Difference]: Finished difference Result 1508 states and 5202 transitions. [2020-01-16 18:35:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:21,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:21,982 INFO L225 Difference]: With dead ends: 1508 [2020-01-16 18:35:21,982 INFO L226 Difference]: Without dead ends: 1493 [2020-01-16 18:35:21,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-01-16 18:35:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 810. [2020-01-16 18:35:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:35:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3182 transitions. [2020-01-16 18:35:22,005 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3182 transitions. Word has length 25 [2020-01-16 18:35:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:22,005 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3182 transitions. [2020-01-16 18:35:22,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3182 transitions. [2020-01-16 18:35:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:22,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:22,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:22,006 INFO L426 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash 745025203, now seen corresponding path program 466 times [2020-01-16 18:35:22,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:22,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502663612] [2020-01-16 18:35:22,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:22,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502663612] [2020-01-16 18:35:22,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:22,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:22,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849482441] [2020-01-16 18:35:22,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:22,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:22,415 INFO L87 Difference]: Start difference. First operand 810 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:35:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:22,534 INFO L93 Difference]: Finished difference Result 1511 states and 5201 transitions. [2020-01-16 18:35:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:22,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:22,537 INFO L225 Difference]: With dead ends: 1511 [2020-01-16 18:35:22,537 INFO L226 Difference]: Without dead ends: 1486 [2020-01-16 18:35:22,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-01-16 18:35:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 803. [2020-01-16 18:35:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:35:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3162 transitions. [2020-01-16 18:35:22,559 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3162 transitions. Word has length 25 [2020-01-16 18:35:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:22,559 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3162 transitions. [2020-01-16 18:35:22,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3162 transitions. [2020-01-16 18:35:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:22,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:22,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:22,560 INFO L426 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1382765125, now seen corresponding path program 467 times [2020-01-16 18:35:22,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:22,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004161581] [2020-01-16 18:35:22,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:22,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004161581] [2020-01-16 18:35:22,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:22,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:22,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524710885] [2020-01-16 18:35:22,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:22,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:22,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:22,962 INFO L87 Difference]: Start difference. First operand 803 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:35:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:23,098 INFO L93 Difference]: Finished difference Result 1512 states and 5203 transitions. [2020-01-16 18:35:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:23,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:23,101 INFO L225 Difference]: With dead ends: 1512 [2020-01-16 18:35:23,101 INFO L226 Difference]: Without dead ends: 1496 [2020-01-16 18:35:23,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-01-16 18:35:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 812. [2020-01-16 18:35:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-01-16 18:35:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 3178 transitions. [2020-01-16 18:35:23,123 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 3178 transitions. Word has length 25 [2020-01-16 18:35:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:23,123 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 3178 transitions. [2020-01-16 18:35:23,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 3178 transitions. [2020-01-16 18:35:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:23,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:23,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] [2020-01-16 18:35:23,124 INFO L426 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1839116791, now seen corresponding path program 468 times [2020-01-16 18:35:23,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:23,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295291787] [2020-01-16 18:35:23,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:23,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-01-16 18:35:23,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295291787] [2020-01-16 18:35:23,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:23,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:23,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973738499] [2020-01-16 18:35:23,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:23,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:23,539 INFO L87 Difference]: Start difference. First operand 812 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:35:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:23,677 INFO L93 Difference]: Finished difference Result 1514 states and 5199 transitions. [2020-01-16 18:35:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:23,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:23,681 INFO L225 Difference]: With dead ends: 1514 [2020-01-16 18:35:23,681 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:35:23,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:35:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 794. [2020-01-16 18:35:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:35:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-01-16 18:35:23,702 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:23,703 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-01-16 18:35:23,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-01-16 18:35:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:23,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:23,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:23,704 INFO L426 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700599, now seen corresponding path program 469 times [2020-01-16 18:35:23,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:23,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350703495] [2020-01-16 18:35:23,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:24,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350703495] [2020-01-16 18:35:24,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:24,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:24,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603180759] [2020-01-16 18:35:24,094 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:24,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:24,094 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:24,257 INFO L93 Difference]: Finished difference Result 1493 states and 5167 transitions. [2020-01-16 18:35:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:24,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:24,261 INFO L225 Difference]: With dead ends: 1493 [2020-01-16 18:35:24,261 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:35:24,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:35:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 805. [2020-01-16 18:35:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:35:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3169 transitions. [2020-01-16 18:35:24,283 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3169 transitions. Word has length 25 [2020-01-16 18:35:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:24,283 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3169 transitions. [2020-01-16 18:35:24,283 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3169 transitions. [2020-01-16 18:35:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:24,284 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:24,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:24,285 INFO L426 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1634411119, now seen corresponding path program 470 times [2020-01-16 18:35:24,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:24,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053239989] [2020-01-16 18:35:24,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:24,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053239989] [2020-01-16 18:35:24,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:24,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:24,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818127028] [2020-01-16 18:35:24,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:24,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:24,712 INFO L87 Difference]: Start difference. First operand 805 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:35:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:24,845 INFO L93 Difference]: Finished difference Result 1492 states and 5160 transitions. [2020-01-16 18:35:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:24,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:24,849 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:35:24,849 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:35:24,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:35:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 800. [2020-01-16 18:35:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:35:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3155 transitions. [2020-01-16 18:35:24,872 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3155 transitions. Word has length 25 [2020-01-16 18:35:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:24,872 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3155 transitions. [2020-01-16 18:35:24,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3155 transitions. [2020-01-16 18:35:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:24,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:24,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:24,873 INFO L426 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash 522262745, now seen corresponding path program 471 times [2020-01-16 18:35:24,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:24,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559605045] [2020-01-16 18:35:24,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:25,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559605045] [2020-01-16 18:35:25,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:25,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:25,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134521041] [2020-01-16 18:35:25,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:25,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:25,287 INFO L87 Difference]: Start difference. First operand 800 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:35:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:25,421 INFO L93 Difference]: Finished difference Result 1499 states and 5174 transitions. [2020-01-16 18:35:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:25,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:25,424 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:35:25,425 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:35:25,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:35:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 807. [2020-01-16 18:35:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:35:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3168 transitions. [2020-01-16 18:35:25,446 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3168 transitions. Word has length 25 [2020-01-16 18:35:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:25,447 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3168 transitions. [2020-01-16 18:35:25,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3168 transitions. [2020-01-16 18:35:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:25,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:25,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:25,448 INFO L426 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1623908015, now seen corresponding path program 472 times [2020-01-16 18:35:25,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:25,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503638653] [2020-01-16 18:35:25,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:25,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503638653] [2020-01-16 18:35:25,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:25,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:25,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819087149] [2020-01-16 18:35:25,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:25,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:25,846 INFO L87 Difference]: Start difference. First operand 807 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:35:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:25,983 INFO L93 Difference]: Finished difference Result 1502 states and 5173 transitions. [2020-01-16 18:35:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:25,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:25,987 INFO L225 Difference]: With dead ends: 1502 [2020-01-16 18:35:25,987 INFO L226 Difference]: Without dead ends: 1477 [2020-01-16 18:35:25,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-01-16 18:35:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 800. [2020-01-16 18:35:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:35:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3149 transitions. [2020-01-16 18:35:26,009 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3149 transitions. Word has length 25 [2020-01-16 18:35:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:26,009 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3149 transitions. [2020-01-16 18:35:26,009 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3149 transitions. [2020-01-16 18:35:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:26,010 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:26,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:26,011 INFO L426 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash 553772057, now seen corresponding path program 473 times [2020-01-16 18:35:26,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:26,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980585542] [2020-01-16 18:35:26,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:26,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980585542] [2020-01-16 18:35:26,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:26,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:26,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950976711] [2020-01-16 18:35:26,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:26,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:26,405 INFO L87 Difference]: Start difference. First operand 800 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:35:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:26,547 INFO L93 Difference]: Finished difference Result 1496 states and 5161 transitions. [2020-01-16 18:35:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:26,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:26,551 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:35:26,551 INFO L226 Difference]: Without dead ends: 1482 [2020-01-16 18:35:26,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-01-16 18:35:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 806. [2020-01-16 18:35:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:35:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3160 transitions. [2020-01-16 18:35:26,573 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3160 transitions. Word has length 25 [2020-01-16 18:35:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:26,573 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3160 transitions. [2020-01-16 18:35:26,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3160 transitions. [2020-01-16 18:35:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:26,574 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:26,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:26,574 INFO L426 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2130254281, now seen corresponding path program 474 times [2020-01-16 18:35:26,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:26,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221527661] [2020-01-16 18:35:26,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:26,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221527661] [2020-01-16 18:35:26,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:26,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:26,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208932016] [2020-01-16 18:35:26,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:26,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:26,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:26,974 INFO L87 Difference]: Start difference. First operand 806 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:35:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:27,089 INFO L93 Difference]: Finished difference Result 1500 states and 5163 transitions. [2020-01-16 18:35:27,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:27,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:27,092 INFO L225 Difference]: With dead ends: 1500 [2020-01-16 18:35:27,093 INFO L226 Difference]: Without dead ends: 1470 [2020-01-16 18:35:27,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-01-16 18:35:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 794. [2020-01-16 18:35:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:35:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3132 transitions. [2020-01-16 18:35:27,114 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3132 transitions. Word has length 25 [2020-01-16 18:35:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:27,115 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3132 transitions. [2020-01-16 18:35:27,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3132 transitions. [2020-01-16 18:35:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:27,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:27,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:27,116 INFO L426 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1700807667, now seen corresponding path program 475 times [2020-01-16 18:35:27,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:27,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842520837] [2020-01-16 18:35:27,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:27,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842520837] [2020-01-16 18:35:27,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:27,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:27,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742679650] [2020-01-16 18:35:27,506 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:27,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:27,507 INFO L87 Difference]: Start difference. First operand 794 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:35:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:27,665 INFO L93 Difference]: Finished difference Result 1499 states and 5173 transitions. [2020-01-16 18:35:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:27,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:27,668 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:35:27,668 INFO L226 Difference]: Without dead ends: 1483 [2020-01-16 18:35:27,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2020-01-16 18:35:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 806. [2020-01-16 18:35:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:35:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3165 transitions. [2020-01-16 18:35:27,689 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3165 transitions. Word has length 25 [2020-01-16 18:35:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:27,689 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3165 transitions. [2020-01-16 18:35:27,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3165 transitions. [2020-01-16 18:35:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:27,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:27,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:27,691 INFO L426 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash -983218671, now seen corresponding path program 476 times [2020-01-16 18:35:27,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:27,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436086738] [2020-01-16 18:35:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:28,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436086738] [2020-01-16 18:35:28,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:28,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:28,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046721691] [2020-01-16 18:35:28,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:28,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:28,078 INFO L87 Difference]: Start difference. First operand 806 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:35:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:28,257 INFO L93 Difference]: Finished difference Result 1497 states and 5164 transitions. [2020-01-16 18:35:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:28,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:28,261 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:35:28,261 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:35:28,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:35:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 801. [2020-01-16 18:35:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-01-16 18:35:28,283 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-01-16 18:35:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:28,283 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-01-16 18:35:28,283 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-01-16 18:35:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:28,284 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:28,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:28,284 INFO L426 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash 100369813, now seen corresponding path program 477 times [2020-01-16 18:35:28,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:28,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194168545] [2020-01-16 18:35:28,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:28,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-01-16 18:35:28,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194168545] [2020-01-16 18:35:28,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:28,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:28,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456287123] [2020-01-16 18:35:28,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:28,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:28,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:28,695 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:35:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:28,893 INFO L93 Difference]: Finished difference Result 1507 states and 5184 transitions. [2020-01-16 18:35:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:28,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:28,897 INFO L225 Difference]: With dead ends: 1507 [2020-01-16 18:35:28,897 INFO L226 Difference]: Without dead ends: 1491 [2020-01-16 18:35:28,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2020-01-16 18:35:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 810. [2020-01-16 18:35:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:35:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-01-16 18:35:28,919 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-01-16 18:35:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:28,919 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-01-16 18:35:28,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-01-16 18:35:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:28,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:28,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:28,920 INFO L426 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -972715567, now seen corresponding path program 478 times [2020-01-16 18:35:28,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:28,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602723681] [2020-01-16 18:35:28,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:29,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602723681] [2020-01-16 18:35:29,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:29,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:29,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953837706] [2020-01-16 18:35:29,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:29,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:29,327 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:35:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:29,485 INFO L93 Difference]: Finished difference Result 1509 states and 5180 transitions. [2020-01-16 18:35:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:29,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:29,489 INFO L225 Difference]: With dead ends: 1509 [2020-01-16 18:35:29,489 INFO L226 Difference]: Without dead ends: 1482 [2020-01-16 18:35:29,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-01-16 18:35:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 801. [2020-01-16 18:35:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3144 transitions. [2020-01-16 18:35:29,510 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3144 transitions. Word has length 25 [2020-01-16 18:35:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:29,510 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3144 transitions. [2020-01-16 18:35:29,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3144 transitions. [2020-01-16 18:35:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:29,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:29,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:29,512 INFO L426 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 110872917, now seen corresponding path program 479 times [2020-01-16 18:35:29,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:29,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446186349] [2020-01-16 18:35:29,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:29,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446186349] [2020-01-16 18:35:29,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:29,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:29,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691696870] [2020-01-16 18:35:29,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:29,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:29,908 INFO L87 Difference]: Start difference. First operand 801 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:35:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:30,091 INFO L93 Difference]: Finished difference Result 1500 states and 5162 transitions. [2020-01-16 18:35:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:30,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:30,095 INFO L225 Difference]: With dead ends: 1500 [2020-01-16 18:35:30,096 INFO L226 Difference]: Without dead ends: 1486 [2020-01-16 18:35:30,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-01-16 18:35:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 807. [2020-01-16 18:35:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:35:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3155 transitions. [2020-01-16 18:35:30,117 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3155 transitions. Word has length 25 [2020-01-16 18:35:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:30,117 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3155 transitions. [2020-01-16 18:35:30,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3155 transitions. [2020-01-16 18:35:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:30,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:30,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:30,119 INFO L426 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1721813875, now seen corresponding path program 480 times [2020-01-16 18:35:30,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443553559] [2020-01-16 18:35:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:30,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443553559] [2020-01-16 18:35:30,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:30,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:30,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787010072] [2020-01-16 18:35:30,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:30,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:30,524 INFO L87 Difference]: Start difference. First operand 807 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:35:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:30,645 INFO L93 Difference]: Finished difference Result 1504 states and 5164 transitions. [2020-01-16 18:35:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:30,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:30,649 INFO L225 Difference]: With dead ends: 1504 [2020-01-16 18:35:30,649 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:35:30,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:35:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 776. [2020-01-16 18:35:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:35:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:35:30,671 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:35:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:30,671 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:35:30,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:35:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:30,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:30,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:30,672 INFO L426 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash -470807655, now seen corresponding path program 481 times [2020-01-16 18:35:30,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:30,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775236431] [2020-01-16 18:35:30,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:31,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775236431] [2020-01-16 18:35:31,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:31,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:31,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568497714] [2020-01-16 18:35:31,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:31,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:31,055 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:35:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:31,234 INFO L93 Difference]: Finished difference Result 1389 states and 4892 transitions. [2020-01-16 18:35:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:31,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:31,238 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:35:31,238 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:35:31,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:35:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-01-16 18:35:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3149 transitions. [2020-01-16 18:35:31,258 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3149 transitions. Word has length 25 [2020-01-16 18:35:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:31,259 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3149 transitions. [2020-01-16 18:35:31,259 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3149 transitions. [2020-01-16 18:35:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:31,260 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:31,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:31,260 INFO L426 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 509947063, now seen corresponding path program 482 times [2020-01-16 18:35:31,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:31,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103211497] [2020-01-16 18:35:31,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:31,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-01-16 18:35:31,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103211497] [2020-01-16 18:35:31,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:31,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:31,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473149173] [2020-01-16 18:35:31,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:31,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:31,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:31,637 INFO L87 Difference]: Start difference. First operand 790 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:35:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:31,781 INFO L93 Difference]: Finished difference Result 1388 states and 4887 transitions. [2020-01-16 18:35:31,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:31,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:31,785 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:35:31,785 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:35:31,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:35:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:35:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:35:31,807 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:35:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:31,807 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:35:31,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:35:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:31,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:31,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:31,809 INFO L426 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1455226423, now seen corresponding path program 483 times [2020-01-16 18:35:31,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:31,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310413852] [2020-01-16 18:35:31,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:32,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310413852] [2020-01-16 18:35:32,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:32,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:32,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13082613] [2020-01-16 18:35:32,198 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:32,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:32,198 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:35:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:32,345 INFO L93 Difference]: Finished difference Result 1394 states and 4900 transitions. [2020-01-16 18:35:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:32,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:32,348 INFO L225 Difference]: With dead ends: 1394 [2020-01-16 18:35:32,348 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:35:32,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:35:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 791. [2020-01-16 18:35:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3148 transitions. [2020-01-16 18:35:32,369 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3148 transitions. Word has length 25 [2020-01-16 18:35:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:32,369 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3148 transitions. [2020-01-16 18:35:32,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3148 transitions. [2020-01-16 18:35:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:32,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:32,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:32,370 INFO L426 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1848483051, now seen corresponding path program 484 times [2020-01-16 18:35:32,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:32,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59846451] [2020-01-16 18:35:32,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:32,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-01-16 18:35:32,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59846451] [2020-01-16 18:35:32,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:32,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:32,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252679058] [2020-01-16 18:35:32,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:32,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:32,745 INFO L87 Difference]: Start difference. First operand 791 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:35:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:32,923 INFO L93 Difference]: Finished difference Result 1397 states and 4902 transitions. [2020-01-16 18:35:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:32,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:32,927 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:35:32,927 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:35:32,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:35:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 787. [2020-01-16 18:35:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:35:32,948 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:32,948 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:35:32,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:35:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:32,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:32,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:32,949 INFO L426 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1174168473, now seen corresponding path program 485 times [2020-01-16 18:35:32,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:32,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121333052] [2020-01-16 18:35:32,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:33,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121333052] [2020-01-16 18:35:33,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:33,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:33,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871784968] [2020-01-16 18:35:33,314 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:33,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:33,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:33,314 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:33,460 INFO L93 Difference]: Finished difference Result 1391 states and 4890 transitions. [2020-01-16 18:35:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:33,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:33,464 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:35:33,464 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:35:33,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:35:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-01-16 18:35:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-01-16 18:35:33,486 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-01-16 18:35:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:33,486 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-01-16 18:35:33,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-01-16 18:35:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:33,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:33,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:33,487 INFO L426 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:33,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1509857865, now seen corresponding path program 486 times [2020-01-16 18:35:33,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:33,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522283079] [2020-01-16 18:35:33,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:33,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522283079] [2020-01-16 18:35:33,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:33,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:33,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836985584] [2020-01-16 18:35:33,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:33,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:33,852 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:35:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:34,030 INFO L93 Difference]: Finished difference Result 1395 states and 4895 transitions. [2020-01-16 18:35:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:34,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:34,033 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:35:34,034 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:35:34,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:35:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 784. [2020-01-16 18:35:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:35:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-01-16 18:35:34,055 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-01-16 18:35:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:34,055 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-01-16 18:35:34,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-01-16 18:35:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:34,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:34,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:34,056 INFO L426 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash -893293381, now seen corresponding path program 487 times [2020-01-16 18:35:34,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:34,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787546340] [2020-01-16 18:35:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:34,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787546340] [2020-01-16 18:35:34,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:34,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:34,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409999355] [2020-01-16 18:35:34,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:34,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:34,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:34,447 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:35:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:34,625 INFO L93 Difference]: Finished difference Result 1387 states and 4885 transitions. [2020-01-16 18:35:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:34,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:34,629 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:35:34,629 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:35:34,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:35:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-01-16 18:35:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-01-16 18:35:34,650 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-01-16 18:35:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:34,650 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-01-16 18:35:34,650 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-01-16 18:35:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:34,651 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:34,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:34,652 INFO L426 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 87461337, now seen corresponding path program 488 times [2020-01-16 18:35:34,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:34,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455336143] [2020-01-16 18:35:34,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:35,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455336143] [2020-01-16 18:35:35,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:35,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:35,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237056712] [2020-01-16 18:35:35,032 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:35,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:35,032 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:35:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:35,210 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-01-16 18:35:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:35,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:35,213 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:35:35,213 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:35:35,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:35:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-01-16 18:35:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:35:35,234 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:35,234 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:35:35,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:35:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:35,235 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:35,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:35,236 INFO L426 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1336192521, now seen corresponding path program 489 times [2020-01-16 18:35:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:35,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169745125] [2020-01-16 18:35:35,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169745125] [2020-01-16 18:35:35,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:35,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:35,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175169899] [2020-01-16 18:35:35,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:35,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:35,629 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:35,807 INFO L93 Difference]: Finished difference Result 1390 states and 4889 transitions. [2020-01-16 18:35:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:35,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:35,811 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:35:35,811 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:35:35,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:35:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 791. [2020-01-16 18:35:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:35:35,833 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:35,833 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:35:35,833 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:35:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:35,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:35,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:35,835 INFO L426 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash -334431595, now seen corresponding path program 490 times [2020-01-16 18:35:35,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:35,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88239074] [2020-01-16 18:35:35,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:36,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88239074] [2020-01-16 18:35:36,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:36,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:36,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436916991] [2020-01-16 18:35:36,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:36,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:36,218 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:36,365 INFO L93 Difference]: Finished difference Result 1391 states and 4887 transitions. [2020-01-16 18:35:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:36,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:36,369 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:35:36,369 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:35:36,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:35:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:35:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-01-16 18:35:36,390 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-01-16 18:35:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:36,391 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-01-16 18:35:36,391 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-01-16 18:35:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:36,392 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:36,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:36,392 INFO L426 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1077278971, now seen corresponding path program 491 times [2020-01-16 18:35:36,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:36,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615557106] [2020-01-16 18:35:36,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:36,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-01-16 18:35:36,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615557106] [2020-01-16 18:35:36,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:36,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:36,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840418805] [2020-01-16 18:35:36,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:36,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:36,765 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:35:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:36,905 INFO L93 Difference]: Finished difference Result 1387 states and 4879 transitions. [2020-01-16 18:35:36,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:36,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:36,908 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:35:36,908 INFO L226 Difference]: Without dead ends: 1375 [2020-01-16 18:35:36,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-01-16 18:35:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 790. [2020-01-16 18:35:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:35:36,930 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:35:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:36,930 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:35:36,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:35:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:36,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:36,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:36,931 INFO L426 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash 4193591, now seen corresponding path program 492 times [2020-01-16 18:35:36,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:36,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959343036] [2020-01-16 18:35:36,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:37,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-01-16 18:35:37,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959343036] [2020-01-16 18:35:37,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:37,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:37,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951902318] [2020-01-16 18:35:37,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:37,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:37,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:37,310 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:35:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:37,472 INFO L93 Difference]: Finished difference Result 1389 states and 4880 transitions. [2020-01-16 18:35:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:37,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:37,476 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:35:37,476 INFO L226 Difference]: Without dead ends: 1369 [2020-01-16 18:35:37,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-01-16 18:35:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 784. [2020-01-16 18:35:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:35:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:35:37,496 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:35:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:37,497 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:35:37,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:35:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:37,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:37,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:37,498 INFO L426 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash 610254971, now seen corresponding path program 493 times [2020-01-16 18:35:37,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:37,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601081698] [2020-01-16 18:35:37,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:37,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601081698] [2020-01-16 18:35:37,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:37,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:37,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041276827] [2020-01-16 18:35:37,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:37,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:37,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:37,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:37,867 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:35:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:38,043 INFO L93 Difference]: Finished difference Result 1400 states and 4914 transitions. [2020-01-16 18:35:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:38,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:38,047 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:35:38,047 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:35:38,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:35:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 792. [2020-01-16 18:35:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:35:38,068 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:35:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:38,068 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:35:38,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:35:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:38,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:38,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:38,069 INFO L426 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1601512793, now seen corresponding path program 494 times [2020-01-16 18:35:38,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:38,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347566994] [2020-01-16 18:35:38,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:38,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347566994] [2020-01-16 18:35:38,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:38,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:38,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591433375] [2020-01-16 18:35:38,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:38,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:38,442 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:35:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:38,579 INFO L93 Difference]: Finished difference Result 1403 states and 4916 transitions. [2020-01-16 18:35:38,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:38,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:38,583 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:35:38,583 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:35:38,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:35:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:35:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:35:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:35:38,604 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:38,604 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:35:38,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:35:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:38,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:38,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:38,606 INFO L426 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1758678247, now seen corresponding path program 495 times [2020-01-16 18:35:38,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:38,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602953681] [2020-01-16 18:35:38,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:38,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602953681] [2020-01-16 18:35:38,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:38,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:38,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147701648] [2020-01-16 18:35:38,996 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:38,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:38,997 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:39,141 INFO L93 Difference]: Finished difference Result 1398 states and 4906 transitions. [2020-01-16 18:35:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:39,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:39,145 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:35:39,145 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:35:39,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:35:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-01-16 18:35:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:35:39,166 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:39,166 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:35:39,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:35:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:39,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:39,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:39,167 INFO L426 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:39,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash -756917321, now seen corresponding path program 496 times [2020-01-16 18:35:39,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:39,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053762180] [2020-01-16 18:35:39,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:39,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053762180] [2020-01-16 18:35:39,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:39,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:39,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72446577] [2020-01-16 18:35:39,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:39,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:39,539 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:39,680 INFO L93 Difference]: Finished difference Result 1399 states and 4904 transitions. [2020-01-16 18:35:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:39,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:39,684 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:35:39,684 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:35:39,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:35:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 788. [2020-01-16 18:35:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:35:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:35:39,705 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:35:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:39,706 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:35:39,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:35:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:39,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:39,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:39,707 INFO L426 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1703636869, now seen corresponding path program 497 times [2020-01-16 18:35:39,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:39,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246572302] [2020-01-16 18:35:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:40,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246572302] [2020-01-16 18:35:40,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:40,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:40,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438788094] [2020-01-16 18:35:40,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:40,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:40,087 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:35:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:40,214 INFO L93 Difference]: Finished difference Result 1405 states and 4917 transitions. [2020-01-16 18:35:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:40,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:40,218 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:35:40,218 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:35:40,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:35:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-01-16 18:35:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:35:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-01-16 18:35:40,238 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-01-16 18:35:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:40,239 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-01-16 18:35:40,239 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-01-16 18:35:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:40,240 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:40,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:40,240 INFO L426 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash -92695911, now seen corresponding path program 498 times [2020-01-16 18:35:40,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:40,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658551118] [2020-01-16 18:35:40,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:40,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658551118] [2020-01-16 18:35:40,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:40,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:40,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478538070] [2020-01-16 18:35:40,610 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:40,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:40,611 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:35:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:40,743 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-01-16 18:35:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:40,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:40,747 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:35:40,747 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:35:40,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:35:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-01-16 18:35:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:35:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3124 transitions. [2020-01-16 18:35:40,768 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3124 transitions. Word has length 25 [2020-01-16 18:35:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:40,768 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3124 transitions. [2020-01-16 18:35:40,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3124 transitions. [2020-01-16 18:35:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:40,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:40,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] [2020-01-16 18:35:40,770 INFO L426 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1793744055, now seen corresponding path program 499 times [2020-01-16 18:35:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:40,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277240859] [2020-01-16 18:35:40,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:41,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277240859] [2020-01-16 18:35:41,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:41,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:41,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837124919] [2020-01-16 18:35:41,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:41,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:41,135 INFO L87 Difference]: Start difference. First operand 784 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:35:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:41,274 INFO L93 Difference]: Finished difference Result 1393 states and 4892 transitions. [2020-01-16 18:35:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:41,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:41,278 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:35:41,278 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:35:41,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:35:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 790. [2020-01-16 18:35:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:35:41,298 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:35:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:41,298 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:35:41,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:35:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:41,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:41,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:41,299 INFO L426 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash -890282283, now seen corresponding path program 500 times [2020-01-16 18:35:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:41,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068039374] [2020-01-16 18:35:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:41,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068039374] [2020-01-16 18:35:41,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:41,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:41,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127273492] [2020-01-16 18:35:41,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:41,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:41,659 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:35:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:41,783 INFO L93 Difference]: Finished difference Result 1397 states and 4897 transitions. [2020-01-16 18:35:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:41,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:41,786 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:35:41,786 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:35:41,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:35:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 787. [2020-01-16 18:35:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3132 transitions. [2020-01-16 18:35:41,807 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3132 transitions. Word has length 25 [2020-01-16 18:35:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:41,807 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3132 transitions. [2020-01-16 18:35:41,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3132 transitions. [2020-01-16 18:35:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:41,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:41,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:41,808 INFO L426 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 193306201, now seen corresponding path program 501 times [2020-01-16 18:35:41,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:41,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749969965] [2020-01-16 18:35:41,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:42,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-01-16 18:35:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749969965] [2020-01-16 18:35:42,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:42,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:42,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346000710] [2020-01-16 18:35:42,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:42,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:42,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:42,187 INFO L87 Difference]: Start difference. First operand 787 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:35:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:42,322 INFO L93 Difference]: Finished difference Result 1391 states and 4885 transitions. [2020-01-16 18:35:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:42,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:42,325 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:35:42,325 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:35:42,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:35:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-01-16 18:35:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-01-16 18:35:42,346 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-01-16 18:35:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:42,346 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-01-16 18:35:42,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-01-16 18:35:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:42,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:42,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:42,347 INFO L426 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash -879779179, now seen corresponding path program 502 times [2020-01-16 18:35:42,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:42,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669493917] [2020-01-16 18:35:42,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:42,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669493917] [2020-01-16 18:35:42,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:42,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:42,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42593708] [2020-01-16 18:35:42,731 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:42,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:42,731 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:35:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:42,853 INFO L93 Difference]: Finished difference Result 1393 states and 4886 transitions. [2020-01-16 18:35:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:42,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:42,857 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:35:42,857 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:35:42,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:35:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-01-16 18:35:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:35:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-01-16 18:35:42,878 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-01-16 18:35:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:42,879 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-01-16 18:35:42,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-01-16 18:35:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:42,880 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:42,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:42,880 INFO L426 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 203809305, now seen corresponding path program 503 times [2020-01-16 18:35:42,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:42,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108873956] [2020-01-16 18:35:42,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:43,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-01-16 18:35:43,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108873956] [2020-01-16 18:35:43,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:43,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:43,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521856775] [2020-01-16 18:35:43,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:43,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:43,245 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:35:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:43,367 INFO L93 Difference]: Finished difference Result 1401 states and 4904 transitions. [2020-01-16 18:35:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:43,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:43,371 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:35:43,371 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:35:43,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:35:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-01-16 18:35:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3138 transitions. [2020-01-16 18:35:43,392 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:43,392 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3138 transitions. [2020-01-16 18:35:43,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3138 transitions. [2020-01-16 18:35:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:43,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:43,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:43,393 INFO L426 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1814750263, now seen corresponding path program 504 times [2020-01-16 18:35:43,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:43,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302247071] [2020-01-16 18:35:43,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:43,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-01-16 18:35:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302247071] [2020-01-16 18:35:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678870763] [2020-01-16 18:35:43,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:43,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:43,762 INFO L87 Difference]: Start difference. First operand 792 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:43,889 INFO L93 Difference]: Finished difference Result 1399 states and 4895 transitions. [2020-01-16 18:35:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:43,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:43,893 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:35:43,893 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:35:43,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:35:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 781. [2020-01-16 18:35:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:35:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:35:43,915 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:35:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:43,915 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:35:43,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:35:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:43,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:43,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:43,917 INFO L426 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -682963273, now seen corresponding path program 505 times [2020-01-16 18:35:43,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050747682] [2020-01-16 18:35:43,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:44,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050747682] [2020-01-16 18:35:44,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:44,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:44,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617127015] [2020-01-16 18:35:44,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:44,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:44,307 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:35:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:44,436 INFO L93 Difference]: Finished difference Result 1406 states and 4929 transitions. [2020-01-16 18:35:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:44,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:44,440 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:35:44,440 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:35:44,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:35:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-01-16 18:35:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-01-16 18:35:44,463 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-01-16 18:35:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:44,464 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-01-16 18:35:44,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-01-16 18:35:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:44,465 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:44,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:44,465 INFO L426 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 297791445, now seen corresponding path program 506 times [2020-01-16 18:35:44,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:44,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591494938] [2020-01-16 18:35:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:44,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591494938] [2020-01-16 18:35:44,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:44,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:44,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009503494] [2020-01-16 18:35:44,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:44,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:44,849 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:35:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:44,977 INFO L93 Difference]: Finished difference Result 1405 states and 4924 transitions. [2020-01-16 18:35:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:44,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:44,981 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:35:44,981 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:35:44,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:35:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:35:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:35:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-01-16 18:35:45,002 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:45,003 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-01-16 18:35:45,003 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-01-16 18:35:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:45,004 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:45,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:45,004 INFO L426 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1243070805, now seen corresponding path program 507 times [2020-01-16 18:35:45,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:45,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295257033] [2020-01-16 18:35:45,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:45,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295257033] [2020-01-16 18:35:45,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:45,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362548687] [2020-01-16 18:35:45,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:45,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:45,379 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:45,502 INFO L93 Difference]: Finished difference Result 1411 states and 4937 transitions. [2020-01-16 18:35:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:45,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:45,506 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:35:45,506 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:35:45,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:35:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:35:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:35:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:35:45,528 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:35:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:45,528 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:35:45,528 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:35:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:45,529 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:45,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:45,529 INFO L426 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2060638669, now seen corresponding path program 508 times [2020-01-16 18:35:45,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:45,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088309214] [2020-01-16 18:35:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:45,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-01-16 18:35:45,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088309214] [2020-01-16 18:35:45,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:45,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:45,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392865185] [2020-01-16 18:35:45,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:45,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:45,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:45,916 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:35:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:46,062 INFO L93 Difference]: Finished difference Result 1414 states and 4939 transitions. [2020-01-16 18:35:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:46,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:46,065 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:35:46,066 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:35:46,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:35:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:35:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:35:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-01-16 18:35:46,086 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-01-16 18:35:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:46,086 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-01-16 18:35:46,086 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-01-16 18:35:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:46,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:46,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:46,087 INFO L426 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 962012855, now seen corresponding path program 509 times [2020-01-16 18:35:46,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:46,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118020121] [2020-01-16 18:35:46,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:46,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118020121] [2020-01-16 18:35:46,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:46,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:46,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231211227] [2020-01-16 18:35:46,459 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:46,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:46,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:46,460 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:35:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:46,582 INFO L93 Difference]: Finished difference Result 1408 states and 4927 transitions. [2020-01-16 18:35:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:46,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:46,586 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:35:46,586 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:35:46,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:35:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:35:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:35:46,608 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:35:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:46,608 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:35:46,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:35:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:46,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:46,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:46,609 INFO L426 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1722013483, now seen corresponding path program 510 times [2020-01-16 18:35:46,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:46,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781634766] [2020-01-16 18:35:46,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:46,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781634766] [2020-01-16 18:35:46,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:46,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:46,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976293468] [2020-01-16 18:35:46,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:46,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:46,985 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:35:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:47,122 INFO L93 Difference]: Finished difference Result 1412 states and 4932 transitions. [2020-01-16 18:35:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:47,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:47,126 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:35:47,126 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:35:47,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:35:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-01-16 18:35:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:35:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3134 transitions. [2020-01-16 18:35:47,148 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3134 transitions. Word has length 25 [2020-01-16 18:35:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:47,148 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3134 transitions. [2020-01-16 18:35:47,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3134 transitions. [2020-01-16 18:35:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:47,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:47,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:47,149 INFO L426 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1527934725, now seen corresponding path program 511 times [2020-01-16 18:35:47,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:47,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944997252] [2020-01-16 18:35:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:47,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944997252] [2020-01-16 18:35:47,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:47,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:47,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658352197] [2020-01-16 18:35:47,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:47,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:47,555 INFO L87 Difference]: Start difference. First operand 786 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:35:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:47,682 INFO L93 Difference]: Finished difference Result 1411 states and 4936 transitions. [2020-01-16 18:35:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:47,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:47,686 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:35:47,686 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:35:47,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:35:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:35:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:35:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3153 transitions. [2020-01-16 18:35:47,707 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3153 transitions. Word has length 25 [2020-01-16 18:35:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:47,707 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3153 transitions. [2020-01-16 18:35:47,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3153 transitions. [2020-01-16 18:35:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:47,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:47,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:47,708 INFO L426 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -547180007, now seen corresponding path program 512 times [2020-01-16 18:35:47,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:47,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319647209] [2020-01-16 18:35:47,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:48,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319647209] [2020-01-16 18:35:48,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:48,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:48,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702300344] [2020-01-16 18:35:48,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:48,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:48,090 INFO L87 Difference]: Start difference. First operand 793 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:35:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:48,220 INFO L93 Difference]: Finished difference Result 1410 states and 4931 transitions. [2020-01-16 18:35:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:48,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:48,223 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:35:48,223 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:35:48,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:35:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-01-16 18:35:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3145 transitions. [2020-01-16 18:35:48,244 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:48,244 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3145 transitions. [2020-01-16 18:35:48,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3145 transitions. [2020-01-16 18:35:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:48,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:48,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:48,246 INFO L426 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash -44799787, now seen corresponding path program 513 times [2020-01-16 18:35:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431283478] [2020-01-16 18:35:48,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:48,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431283478] [2020-01-16 18:35:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:48,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:48,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574660191] [2020-01-16 18:35:48,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:48,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:48,622 INFO L87 Difference]: Start difference. First operand 790 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:48,766 INFO L93 Difference]: Finished difference Result 1419 states and 4949 transitions. [2020-01-16 18:35:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:48,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:48,769 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:35:48,769 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:35:48,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:35:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 795. [2020-01-16 18:35:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:35:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-01-16 18:35:48,790 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-01-16 18:35:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:48,790 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-01-16 18:35:48,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-01-16 18:35:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:48,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:48,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:48,791 INFO L426 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 967464243, now seen corresponding path program 514 times [2020-01-16 18:35:48,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:48,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053712339] [2020-01-16 18:35:48,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:49,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053712339] [2020-01-16 18:35:49,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:49,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:49,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378952486] [2020-01-16 18:35:49,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:49,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:49,179 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:35:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:49,288 INFO L93 Difference]: Finished difference Result 1424 states and 4954 transitions. [2020-01-16 18:35:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:49,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:49,292 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:35:49,292 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:35:49,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:35:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 790. [2020-01-16 18:35:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:35:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-01-16 18:35:49,313 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-01-16 18:35:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:49,313 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-01-16 18:35:49,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-01-16 18:35:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:49,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:49,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:49,314 INFO L426 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash 768233851, now seen corresponding path program 515 times [2020-01-16 18:35:49,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:49,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771479231] [2020-01-16 18:35:49,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:49,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771479231] [2020-01-16 18:35:49,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:49,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:49,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943753041] [2020-01-16 18:35:49,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:49,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:49,709 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:35:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:49,832 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-01-16 18:35:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:49,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:49,836 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:35:49,836 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:35:49,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:35:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 794. [2020-01-16 18:35:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:35:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3148 transitions. [2020-01-16 18:35:49,857 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3148 transitions. Word has length 25 [2020-01-16 18:35:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:49,857 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3148 transitions. [2020-01-16 18:35:49,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3148 transitions. [2020-01-16 18:35:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:49,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:49,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:49,859 INFO L426 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1306089429, now seen corresponding path program 516 times [2020-01-16 18:35:49,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:49,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603764298] [2020-01-16 18:35:49,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:50,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603764298] [2020-01-16 18:35:50,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:50,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:50,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496474583] [2020-01-16 18:35:50,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:50,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:50,237 INFO L87 Difference]: Start difference. First operand 794 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:35:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:50,338 INFO L93 Difference]: Finished difference Result 1422 states and 4946 transitions. [2020-01-16 18:35:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:50,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:50,341 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:35:50,341 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:35:50,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:35:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-01-16 18:35:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:35:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-01-16 18:35:50,363 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-01-16 18:35:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:50,363 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-01-16 18:35:50,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-01-16 18:35:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:50,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:50,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:50,364 INFO L426 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -24386373, now seen corresponding path program 517 times [2020-01-16 18:35:50,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:50,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312855151] [2020-01-16 18:35:50,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:50,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312855151] [2020-01-16 18:35:50,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:50,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:50,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614479403] [2020-01-16 18:35:50,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:50,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:50,747 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:35:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:50,873 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:35:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:50,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:50,877 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:35:50,877 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:35:50,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:35:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 796. [2020-01-16 18:35:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:35:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3157 transitions. [2020-01-16 18:35:50,898 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3157 transitions. Word has length 25 [2020-01-16 18:35:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:50,898 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3157 transitions. [2020-01-16 18:35:50,898 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3157 transitions. [2020-01-16 18:35:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:50,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:50,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:50,899 INFO L426 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 966871449, now seen corresponding path program 518 times [2020-01-16 18:35:50,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940375742] [2020-01-16 18:35:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:51,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940375742] [2020-01-16 18:35:51,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:51,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:51,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826004034] [2020-01-16 18:35:51,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:51,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:51,284 INFO L87 Difference]: Start difference. First operand 796 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:35:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:51,413 INFO L93 Difference]: Finished difference Result 1431 states and 4975 transitions. [2020-01-16 18:35:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:51,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:51,417 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:35:51,417 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:35:51,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:35:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 792. [2020-01-16 18:35:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-01-16 18:35:51,438 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-01-16 18:35:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:51,439 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-01-16 18:35:51,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-01-16 18:35:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:51,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:51,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:51,440 INFO L426 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash -467285513, now seen corresponding path program 519 times [2020-01-16 18:35:51,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:51,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304304892] [2020-01-16 18:35:51,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:51,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-01-16 18:35:51,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304304892] [2020-01-16 18:35:51,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:51,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:51,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129981006] [2020-01-16 18:35:51,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:51,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:51,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:51,824 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:35:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:51,956 INFO L93 Difference]: Finished difference Result 1431 states and 4974 transitions. [2020-01-16 18:35:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:51,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:51,960 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:35:51,960 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:35:51,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:35:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 797. [2020-01-16 18:35:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:35:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3155 transitions. [2020-01-16 18:35:51,981 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3155 transitions. Word has length 25 [2020-01-16 18:35:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:51,981 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3155 transitions. [2020-01-16 18:35:51,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3155 transitions. [2020-01-16 18:35:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:51,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:51,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:51,983 INFO L426 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 544978517, now seen corresponding path program 520 times [2020-01-16 18:35:51,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:51,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567498873] [2020-01-16 18:35:51,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:52,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567498873] [2020-01-16 18:35:52,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:52,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:52,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913433157] [2020-01-16 18:35:52,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:52,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:52,370 INFO L87 Difference]: Start difference. First operand 797 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:35:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:52,484 INFO L93 Difference]: Finished difference Result 1436 states and 4979 transitions. [2020-01-16 18:35:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:52,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:52,488 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:35:52,488 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:35:52,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:35:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 792. [2020-01-16 18:35:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:35:52,509 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:35:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:52,509 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:35:52,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:35:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:52,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:52,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:52,510 INFO L426 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2012681989, now seen corresponding path program 521 times [2020-01-16 18:35:52,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:52,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289981543] [2020-01-16 18:35:52,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:52,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-01-16 18:35:52,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289981543] [2020-01-16 18:35:52,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:52,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:52,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569639060] [2020-01-16 18:35:52,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:52,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:52,903 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:35:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:53,034 INFO L93 Difference]: Finished difference Result 1441 states and 4991 transitions. [2020-01-16 18:35:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:53,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:53,038 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:35:53,038 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:35:53,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:35:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 801. [2020-01-16 18:35:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:35:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3157 transitions. [2020-01-16 18:35:53,059 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3157 transitions. Word has length 25 [2020-01-16 18:35:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:53,059 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3157 transitions. [2020-01-16 18:35:53,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3157 transitions. [2020-01-16 18:35:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:53,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:53,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:53,060 INFO L426 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199927, now seen corresponding path program 522 times [2020-01-16 18:35:53,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:53,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130517975] [2020-01-16 18:35:53,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:53,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130517975] [2020-01-16 18:35:53,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:53,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:53,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078301256] [2020-01-16 18:35:53,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:53,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:53,488 INFO L87 Difference]: Start difference. First operand 801 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:35:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:53,599 INFO L93 Difference]: Finished difference Result 1443 states and 4987 transitions. [2020-01-16 18:35:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:53,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:53,603 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:35:53,603 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:35:53,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:35:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 786. [2020-01-16 18:35:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:35:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3125 transitions. [2020-01-16 18:35:53,624 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3125 transitions. Word has length 25 [2020-01-16 18:35:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:53,624 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3125 transitions. [2020-01-16 18:35:53,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3125 transitions. [2020-01-16 18:35:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:53,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:53,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:53,625 INFO L426 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1209830507, now seen corresponding path program 523 times [2020-01-16 18:35:53,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:53,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895534879] [2020-01-16 18:35:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:54,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895534879] [2020-01-16 18:35:54,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:54,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:54,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931982404] [2020-01-16 18:35:54,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:54,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:54,010 INFO L87 Difference]: Start difference. First operand 786 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:35:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:54,140 INFO L93 Difference]: Finished difference Result 1421 states and 4949 transitions. [2020-01-16 18:35:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:54,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:54,143 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:35:54,143 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:35:54,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:35:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-01-16 18:35:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:35:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:35:54,165 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:35:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:54,165 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:35:54,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:35:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:54,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:54,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:54,166 INFO L426 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 401110451, now seen corresponding path program 524 times [2020-01-16 18:35:54,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:54,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180481235] [2020-01-16 18:35:54,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:54,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180481235] [2020-01-16 18:35:54,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:54,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:54,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519909858] [2020-01-16 18:35:54,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:54,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:54,563 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:35:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:54,691 INFO L93 Difference]: Finished difference Result 1425 states and 4954 transitions. [2020-01-16 18:35:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:54,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:54,694 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:35:54,694 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:35:54,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:35:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 791. [2020-01-16 18:35:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-01-16 18:35:54,715 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-01-16 18:35:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:54,715 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-01-16 18:35:54,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-01-16 18:35:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:54,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:54,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:54,716 INFO L426 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -115738919, now seen corresponding path program 525 times [2020-01-16 18:35:54,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:54,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776897822] [2020-01-16 18:35:54,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:55,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776897822] [2020-01-16 18:35:55,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:55,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:55,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712961231] [2020-01-16 18:35:55,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:55,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:55,097 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:35:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:55,227 INFO L93 Difference]: Finished difference Result 1424 states and 4951 transitions. [2020-01-16 18:35:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:55,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:55,230 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:35:55,230 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:35:55,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:35:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:35:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:35:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:35:55,253 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:55,253 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:35:55,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:35:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:55,254 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:55,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:55,254 INFO L426 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash 422116659, now seen corresponding path program 526 times [2020-01-16 18:35:55,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:55,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406718998] [2020-01-16 18:35:55,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:55,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-01-16 18:35:55,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406718998] [2020-01-16 18:35:55,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:55,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:55,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138395644] [2020-01-16 18:35:55,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:55,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:55,647 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:55,754 INFO L93 Difference]: Finished difference Result 1430 states and 4959 transitions. [2020-01-16 18:35:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:55,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:55,758 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:35:55,758 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:35:55,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:35:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-01-16 18:35:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-01-16 18:35:55,779 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-01-16 18:35:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:55,779 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-01-16 18:35:55,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-01-16 18:35:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:55,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:55,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:55,781 INFO L426 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -105235815, now seen corresponding path program 527 times [2020-01-16 18:35:55,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:55,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540068106] [2020-01-16 18:35:55,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:56,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540068106] [2020-01-16 18:35:56,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:56,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:56,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104456309] [2020-01-16 18:35:56,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:56,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:56,172 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:35:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:56,300 INFO L93 Difference]: Finished difference Result 1437 states and 4976 transitions. [2020-01-16 18:35:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:56,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:56,303 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:35:56,303 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:35:56,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:35:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 800. [2020-01-16 18:35:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:35:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3150 transitions. [2020-01-16 18:35:56,324 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3150 transitions. Word has length 25 [2020-01-16 18:35:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:56,325 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3150 transitions. [2020-01-16 18:35:56,325 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3150 transitions. [2020-01-16 18:35:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:56,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:56,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:56,326 INFO L426 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1178321195, now seen corresponding path program 528 times [2020-01-16 18:35:56,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:56,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175326482] [2020-01-16 18:35:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:56,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175326482] [2020-01-16 18:35:56,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:56,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:56,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964058099] [2020-01-16 18:35:56,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:56,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:56,727 INFO L87 Difference]: Start difference. First operand 800 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:35:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:56,873 INFO L93 Difference]: Finished difference Result 1439 states and 4972 transitions. [2020-01-16 18:35:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:56,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:56,876 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:35:56,877 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:35:56,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:35:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 781. [2020-01-16 18:35:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:35:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3111 transitions. [2020-01-16 18:35:56,898 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3111 transitions. Word has length 25 [2020-01-16 18:35:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:56,898 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3111 transitions. [2020-01-16 18:35:56,898 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3111 transitions. [2020-01-16 18:35:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:56,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:56,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:56,899 INFO L426 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:56,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1317604617, now seen corresponding path program 529 times [2020-01-16 18:35:56,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:56,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401115471] [2020-01-16 18:35:56,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:57,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401115471] [2020-01-16 18:35:57,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:57,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:57,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401772954] [2020-01-16 18:35:57,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:57,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:57,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:57,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:57,308 INFO L87 Difference]: Start difference. First operand 781 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:35:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:57,438 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-01-16 18:35:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:57,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:57,442 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:35:57,442 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:35:57,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:35:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-01-16 18:35:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:35:57,463 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:35:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:57,463 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:35:57,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:35:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:57,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:57,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:57,464 INFO L426 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash -336849899, now seen corresponding path program 530 times [2020-01-16 18:35:57,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:57,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632715889] [2020-01-16 18:35:57,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:57,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632715889] [2020-01-16 18:35:57,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:57,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:57,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236828984] [2020-01-16 18:35:57,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:57,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:57,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:57,851 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:35:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:57,993 INFO L93 Difference]: Finished difference Result 1395 states and 4897 transitions. [2020-01-16 18:35:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:57,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:57,997 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:35:57,997 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:35:57,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:35:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-01-16 18:35:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:35:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-01-16 18:35:58,018 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-01-16 18:35:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:58,018 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-01-16 18:35:58,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-01-16 18:35:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:58,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:58,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:58,019 INFO L426 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1760503757, now seen corresponding path program 531 times [2020-01-16 18:35:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:58,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054839387] [2020-01-16 18:35:58,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:58,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054839387] [2020-01-16 18:35:58,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:58,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:58,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072901176] [2020-01-16 18:35:58,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:58,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:58,414 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:35:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:58,547 INFO L93 Difference]: Finished difference Result 1399 states and 4906 transitions. [2020-01-16 18:35:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:58,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:58,550 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:35:58,550 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:35:58,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:35:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-01-16 18:35:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:35:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-01-16 18:35:58,571 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-01-16 18:35:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:58,571 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-01-16 18:35:58,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-01-16 18:35:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:58,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:58,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:58,572 INFO L426 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -758742831, now seen corresponding path program 532 times [2020-01-16 18:35:58,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:58,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31425167] [2020-01-16 18:35:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:58,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31425167] [2020-01-16 18:35:58,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:58,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:58,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307541157] [2020-01-16 18:35:58,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:58,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:58,966 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:35:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:59,098 INFO L93 Difference]: Finished difference Result 1400 states and 4904 transitions. [2020-01-16 18:35:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:59,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:59,102 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:35:59,102 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:35:59,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:35:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-01-16 18:35:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:35:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:35:59,123 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:35:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:59,123 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:35:59,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:35:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:59,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:59,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] [2020-01-16 18:35:59,124 INFO L426 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash 652967735, now seen corresponding path program 533 times [2020-01-16 18:35:59,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:59,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780591874] [2020-01-16 18:35:59,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:35:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:35:59,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780591874] [2020-01-16 18:35:59,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:35:59,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:35:59,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304928838] [2020-01-16 18:35:59,510 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:35:59,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:35:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:35:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:35:59,510 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:35:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:35:59,638 INFO L93 Difference]: Finished difference Result 1396 states and 4896 transitions. [2020-01-16 18:35:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:35:59,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:35:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:35:59,642 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:35:59,642 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:35:59,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:35:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:35:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 791. [2020-01-16 18:35:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:35:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-01-16 18:35:59,664 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-01-16 18:35:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:35:59,664 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-01-16 18:35:59,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:35:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-01-16 18:35:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:35:59,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:35:59,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:35:59,666 INFO L426 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:35:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:35:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash -420117645, now seen corresponding path program 534 times [2020-01-16 18:35:59,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:35:59,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210214258] [2020-01-16 18:35:59,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:35:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:00,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210214258] [2020-01-16 18:36:00,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:00,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:00,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666421272] [2020-01-16 18:36:00,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:00,054 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:36:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:00,186 INFO L93 Difference]: Finished difference Result 1398 states and 4897 transitions. [2020-01-16 18:36:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:00,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:00,190 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:36:00,190 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:36:00,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:36:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 785. [2020-01-16 18:36:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:36:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3126 transitions. [2020-01-16 18:36:00,210 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3126 transitions. Word has length 25 [2020-01-16 18:36:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:00,211 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3126 transitions. [2020-01-16 18:36:00,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3126 transitions. [2020-01-16 18:36:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:00,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:00,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:00,212 INFO L426 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1740090343, now seen corresponding path program 535 times [2020-01-16 18:36:00,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:00,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335741442] [2020-01-16 18:36:00,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:00,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335741442] [2020-01-16 18:36:00,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:00,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:00,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868551517] [2020-01-16 18:36:00,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:00,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:00,599 INFO L87 Difference]: Start difference. First operand 785 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:36:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:00,732 INFO L93 Difference]: Finished difference Result 1403 states and 4913 transitions. [2020-01-16 18:36:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:00,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:00,736 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:36:00,736 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:36:00,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:36:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 792. [2020-01-16 18:36:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:36:00,758 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:36:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:00,758 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:36:00,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:36:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:00,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:00,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:00,759 INFO L426 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -759335625, now seen corresponding path program 536 times [2020-01-16 18:36:00,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:00,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814088385] [2020-01-16 18:36:00,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:01,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814088385] [2020-01-16 18:36:01,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:01,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:01,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310073121] [2020-01-16 18:36:01,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:01,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:01,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:01,158 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:36:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:01,307 INFO L93 Difference]: Finished difference Result 1402 states and 4908 transitions. [2020-01-16 18:36:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:01,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:01,311 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:36:01,311 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:36:01,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:36:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 789. [2020-01-16 18:36:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3137 transitions. [2020-01-16 18:36:01,332 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:01,332 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3137 transitions. [2020-01-16 18:36:01,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3137 transitions. [2020-01-16 18:36:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:01,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:01,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:01,334 INFO L426 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -256955405, now seen corresponding path program 537 times [2020-01-16 18:36:01,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:01,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016697623] [2020-01-16 18:36:01,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:01,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-01-16 18:36:01,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016697623] [2020-01-16 18:36:01,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:01,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:01,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823642481] [2020-01-16 18:36:01,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:01,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:01,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:01,706 INFO L87 Difference]: Start difference. First operand 789 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:01,853 INFO L93 Difference]: Finished difference Result 1411 states and 4926 transitions. [2020-01-16 18:36:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:01,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:01,857 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:36:01,857 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:36:01,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:36:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:36:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:36:01,878 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:36:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:01,878 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:36:01,878 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:36:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:01,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:01,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:01,879 INFO L426 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 755308625, now seen corresponding path program 538 times [2020-01-16 18:36:01,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:01,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531203521] [2020-01-16 18:36:01,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:02,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531203521] [2020-01-16 18:36:02,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:02,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:02,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364688643] [2020-01-16 18:36:02,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:02,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:02,259 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:36:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:02,369 INFO L93 Difference]: Finished difference Result 1416 states and 4931 transitions. [2020-01-16 18:36:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:02,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:02,373 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:36:02,373 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:36:02,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:36:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:36:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3133 transitions. [2020-01-16 18:36:02,394 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3133 transitions. Word has length 25 [2020-01-16 18:36:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:02,395 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3133 transitions. [2020-01-16 18:36:02,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3133 transitions. [2020-01-16 18:36:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:02,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:02,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:02,396 INFO L426 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 556078233, now seen corresponding path program 539 times [2020-01-16 18:36:02,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:02,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874731787] [2020-01-16 18:36:02,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:02,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-01-16 18:36:02,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874731787] [2020-01-16 18:36:02,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:02,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:02,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388424747] [2020-01-16 18:36:02,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:02,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:02,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:02,768 INFO L87 Difference]: Start difference. First operand 789 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:36:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:02,904 INFO L93 Difference]: Finished difference Result 1408 states and 4915 transitions. [2020-01-16 18:36:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:02,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:02,908 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:36:02,908 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:36:02,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:36:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 793. [2020-01-16 18:36:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-01-16 18:36:02,930 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:02,930 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-01-16 18:36:02,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-01-16 18:36:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:02,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:02,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:02,931 INFO L426 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1093933811, now seen corresponding path program 540 times [2020-01-16 18:36:02,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:02,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94386788] [2020-01-16 18:36:02,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:03,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94386788] [2020-01-16 18:36:03,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:03,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:03,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006611230] [2020-01-16 18:36:03,314 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:03,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:03,314 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:03,442 INFO L93 Difference]: Finished difference Result 1414 states and 4923 transitions. [2020-01-16 18:36:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:03,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:03,446 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:36:03,446 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:36:03,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:36:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 785. [2020-01-16 18:36:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:36:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3122 transitions. [2020-01-16 18:36:03,467 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3122 transitions. Word has length 25 [2020-01-16 18:36:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:03,468 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3122 transitions. [2020-01-16 18:36:03,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3122 transitions. [2020-01-16 18:36:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:03,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:03,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:03,469 INFO L426 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1267006361, now seen corresponding path program 541 times [2020-01-16 18:36:03,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:03,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611932436] [2020-01-16 18:36:03,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:03,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611932436] [2020-01-16 18:36:03,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:03,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:03,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766892438] [2020-01-16 18:36:03,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:03,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:03,855 INFO L87 Difference]: Start difference. First operand 785 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:36:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:03,984 INFO L93 Difference]: Finished difference Result 1412 states and 4933 transitions. [2020-01-16 18:36:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:03,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:03,988 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:36:03,988 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:36:03,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:36:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-01-16 18:36:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-01-16 18:36:04,009 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-01-16 18:36:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:04,009 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-01-16 18:36:04,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-01-16 18:36:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:04,011 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:04,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:04,011 INFO L426 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2026200009, now seen corresponding path program 542 times [2020-01-16 18:36:04,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:04,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108775061] [2020-01-16 18:36:04,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:04,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108775061] [2020-01-16 18:36:04,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:04,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:04,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607690734] [2020-01-16 18:36:04,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:04,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:04,401 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:36:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:04,537 INFO L93 Difference]: Finished difference Result 1413 states and 4931 transitions. [2020-01-16 18:36:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:04,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:04,541 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:36:04,541 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:36:04,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:36:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-01-16 18:36:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:36:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-01-16 18:36:04,561 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:04,561 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-01-16 18:36:04,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-01-16 18:36:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:04,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:04,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:04,562 INFO L426 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:04,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1101926857, now seen corresponding path program 543 times [2020-01-16 18:36:04,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:04,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768545315] [2020-01-16 18:36:04,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:04,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768545315] [2020-01-16 18:36:04,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:04,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:04,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154138044] [2020-01-16 18:36:04,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:04,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:04,968 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:05,101 INFO L93 Difference]: Finished difference Result 1417 states and 4938 transitions. [2020-01-16 18:36:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:05,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:05,105 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:36:05,105 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:36:05,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:36:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-01-16 18:36:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:36:05,127 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:36:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:05,127 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:36:05,127 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:36:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:05,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:05,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:05,128 INFO L426 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -89662827, now seen corresponding path program 544 times [2020-01-16 18:36:05,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:05,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051005412] [2020-01-16 18:36:05,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:05,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051005412] [2020-01-16 18:36:05,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:05,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:05,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842993101] [2020-01-16 18:36:05,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:05,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:05,520 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:36:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:05,655 INFO L93 Difference]: Finished difference Result 1422 states and 4943 transitions. [2020-01-16 18:36:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:05,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:05,659 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:36:05,659 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:36:05,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:36:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:36:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:36:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3131 transitions. [2020-01-16 18:36:05,681 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3131 transitions. Word has length 25 [2020-01-16 18:36:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:05,681 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3131 transitions. [2020-01-16 18:36:05,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3131 transitions. [2020-01-16 18:36:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:05,682 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:05,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:05,682 INFO L426 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:05,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:05,682 INFO L82 PathProgramCache]: Analyzing trace with hash -710786151, now seen corresponding path program 545 times [2020-01-16 18:36:05,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:05,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860501167] [2020-01-16 18:36:05,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:06,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860501167] [2020-01-16 18:36:06,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:06,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:06,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607171694] [2020-01-16 18:36:06,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:06,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:06,074 INFO L87 Difference]: Start difference. First operand 790 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:36:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:06,204 INFO L93 Difference]: Finished difference Result 1420 states and 4940 transitions. [2020-01-16 18:36:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:06,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:06,207 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:36:06,208 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:36:06,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:36:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 796. [2020-01-16 18:36:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3142 transitions. [2020-01-16 18:36:06,229 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3142 transitions. Word has length 25 [2020-01-16 18:36:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:06,229 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3142 transitions. [2020-01-16 18:36:06,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3142 transitions. [2020-01-16 18:36:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:06,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:06,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:06,230 INFO L426 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash 900154807, now seen corresponding path program 546 times [2020-01-16 18:36:06,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:06,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971231303] [2020-01-16 18:36:06,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:06,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-01-16 18:36:06,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971231303] [2020-01-16 18:36:06,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:06,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:06,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457903026] [2020-01-16 18:36:06,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:06,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:06,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:06,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:06,627 INFO L87 Difference]: Start difference. First operand 796 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:36:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:06,735 INFO L93 Difference]: Finished difference Result 1424 states and 4942 transitions. [2020-01-16 18:36:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:06,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:06,738 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:36:06,738 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:36:06,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:36:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2020-01-16 18:36:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:36:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3118 transitions. [2020-01-16 18:36:06,759 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3118 transitions. Word has length 25 [2020-01-16 18:36:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:06,759 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3118 transitions. [2020-01-16 18:36:06,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3118 transitions. [2020-01-16 18:36:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:06,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:06,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:06,760 INFO L426 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1518875627, now seen corresponding path program 547 times [2020-01-16 18:36:06,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:06,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052182394] [2020-01-16 18:36:06,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052182394] [2020-01-16 18:36:07,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:07,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:07,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279874845] [2020-01-16 18:36:07,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:07,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:07,146 INFO L87 Difference]: Start difference. First operand 785 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:36:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:07,277 INFO L93 Difference]: Finished difference Result 1405 states and 4910 transitions. [2020-01-16 18:36:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:07,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:07,280 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:36:07,280 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:36:07,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:36:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-01-16 18:36:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:36:07,302 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:07,303 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:36:07,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:36:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:07,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:07,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:07,304 INFO L426 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:07,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1703006289, now seen corresponding path program 548 times [2020-01-16 18:36:07,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:07,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353750624] [2020-01-16 18:36:07,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353750624] [2020-01-16 18:36:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:07,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628314094] [2020-01-16 18:36:07,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:07,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:07,688 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:07,817 INFO L93 Difference]: Finished difference Result 1407 states and 4911 transitions. [2020-01-16 18:36:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:07,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:07,821 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:36:07,821 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:36:07,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:36:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:36:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-01-16 18:36:07,842 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-01-16 18:36:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:07,842 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-01-16 18:36:07,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-01-16 18:36:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:07,843 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:07,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:07,843 INFO L426 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1175653815, now seen corresponding path program 549 times [2020-01-16 18:36:07,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:07,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855183479] [2020-01-16 18:36:07,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:08,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855183479] [2020-01-16 18:36:08,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:08,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:08,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203239933] [2020-01-16 18:36:08,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:08,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:08,223 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:36:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:08,361 INFO L93 Difference]: Finished difference Result 1410 states and 4916 transitions. [2020-01-16 18:36:08,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:08,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:08,365 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:36:08,365 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:36:08,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:36:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:36:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3136 transitions. [2020-01-16 18:36:08,386 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:08,386 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3136 transitions. [2020-01-16 18:36:08,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3136 transitions. [2020-01-16 18:36:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:08,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:08,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:08,387 INFO L426 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1713509393, now seen corresponding path program 550 times [2020-01-16 18:36:08,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:08,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373280344] [2020-01-16 18:36:08,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:08,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-01-16 18:36:08,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373280344] [2020-01-16 18:36:08,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:08,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:08,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069338970] [2020-01-16 18:36:08,791 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:08,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:08,792 INFO L87 Difference]: Start difference. First operand 793 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:08,903 INFO L93 Difference]: Finished difference Result 1416 states and 4924 transitions. [2020-01-16 18:36:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:08,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:08,907 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:36:08,907 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:36:08,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:36:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:36:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3125 transitions. [2020-01-16 18:36:08,928 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3125 transitions. Word has length 25 [2020-01-16 18:36:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:08,928 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3125 transitions. [2020-01-16 18:36:08,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3125 transitions. [2020-01-16 18:36:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:08,930 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:08,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:08,930 INFO L426 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1196660023, now seen corresponding path program 551 times [2020-01-16 18:36:08,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:08,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376526784] [2020-01-16 18:36:08,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:09,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376526784] [2020-01-16 18:36:09,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:09,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:09,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330517755] [2020-01-16 18:36:09,319 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:09,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:09,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:09,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:09,320 INFO L87 Difference]: Start difference. First operand 789 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:36:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:09,475 INFO L93 Difference]: Finished difference Result 1416 states and 4926 transitions. [2020-01-16 18:36:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:09,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:09,478 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:36:09,478 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:09,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-01-16 18:36:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3136 transitions. [2020-01-16 18:36:09,499 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:09,499 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3136 transitions. [2020-01-16 18:36:09,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3136 transitions. [2020-01-16 18:36:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:09,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:09,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:09,500 INFO L426 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1487366315, now seen corresponding path program 552 times [2020-01-16 18:36:09,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:09,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518215318] [2020-01-16 18:36:09,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:09,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518215318] [2020-01-16 18:36:09,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:09,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:09,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461518294] [2020-01-16 18:36:09,889 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:09,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:09,889 INFO L87 Difference]: Start difference. First operand 795 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:09,993 INFO L93 Difference]: Finished difference Result 1420 states and 4928 transitions. [2020-01-16 18:36:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:09,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:09,997 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:36:09,997 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:36:09,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:36:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 781. [2020-01-16 18:36:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:36:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:36:10,017 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:36:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:10,018 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:36:10,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:36:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:10,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:10,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:10,019 INFO L426 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -26211883, now seen corresponding path program 553 times [2020-01-16 18:36:10,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:10,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481717664] [2020-01-16 18:36:10,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:10,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-01-16 18:36:10,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481717664] [2020-01-16 18:36:10,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:10,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:10,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302856636] [2020-01-16 18:36:10,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:10,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:10,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:10,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:10,397 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:36:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:10,528 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:36:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:10,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:10,532 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:36:10,532 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:36:10,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:36:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:36:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:36:10,553 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:36:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:10,553 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:36:10,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:36:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:10,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:10,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:10,554 INFO L426 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash 965045939, now seen corresponding path program 554 times [2020-01-16 18:36:10,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:10,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341177588] [2020-01-16 18:36:10,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:10,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341177588] [2020-01-16 18:36:10,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:10,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:10,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158411341] [2020-01-16 18:36:10,921 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:10,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:10,921 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:36:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:11,052 INFO L93 Difference]: Finished difference Result 1432 states and 4990 transitions. [2020-01-16 18:36:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:11,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:11,056 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:36:11,056 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:36:11,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:36:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-01-16 18:36:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3144 transitions. [2020-01-16 18:36:11,078 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3144 transitions. Word has length 25 [2020-01-16 18:36:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:11,078 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3144 transitions. [2020-01-16 18:36:11,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3144 transitions. [2020-01-16 18:36:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:11,079 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:11,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:11,079 INFO L426 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1899822195, now seen corresponding path program 555 times [2020-01-16 18:36:11,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:11,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596483840] [2020-01-16 18:36:11,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:11,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596483840] [2020-01-16 18:36:11,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:11,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:11,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170385903] [2020-01-16 18:36:11,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:11,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:11,460 INFO L87 Difference]: Start difference. First operand 791 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:36:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:11,586 INFO L93 Difference]: Finished difference Result 1427 states and 4980 transitions. [2020-01-16 18:36:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:11,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:11,589 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:36:11,589 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:36:11,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:36:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 795. [2020-01-16 18:36:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:36:11,611 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:36:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:11,611 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:36:11,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:36:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:11,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:11,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] [2020-01-16 18:36:11,612 INFO L426 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1393384175, now seen corresponding path program 556 times [2020-01-16 18:36:11,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:11,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059839240] [2020-01-16 18:36:11,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:11,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059839240] [2020-01-16 18:36:11,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:11,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:11,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212842943] [2020-01-16 18:36:11,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:11,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:11,998 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:36:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:12,128 INFO L93 Difference]: Finished difference Result 1428 states and 4978 transitions. [2020-01-16 18:36:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:12,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:12,132 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:36:12,132 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:36:12,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:36:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-01-16 18:36:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-01-16 18:36:12,154 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:12,154 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-01-16 18:36:12,154 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-01-16 18:36:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:12,155 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:12,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:12,156 INFO L426 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1954863573, now seen corresponding path program 557 times [2020-01-16 18:36:12,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:12,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728598046] [2020-01-16 18:36:12,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:12,549 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:36:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:12,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728598046] [2020-01-16 18:36:12,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:12,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:12,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096427926] [2020-01-16 18:36:12,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:12,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:12,555 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:12,685 INFO L93 Difference]: Finished difference Result 1434 states and 4991 transitions. [2020-01-16 18:36:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:12,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:12,688 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:36:12,688 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:36:12,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:36:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-01-16 18:36:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3149 transitions. [2020-01-16 18:36:12,709 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3149 transitions. Word has length 25 [2020-01-16 18:36:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:12,710 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3149 transitions. [2020-01-16 18:36:12,710 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3149 transitions. [2020-01-16 18:36:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:12,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:12,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:12,711 INFO L426 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -729162765, now seen corresponding path program 558 times [2020-01-16 18:36:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:12,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002708648] [2020-01-16 18:36:12,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:13,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002708648] [2020-01-16 18:36:13,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:13,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:13,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174592233] [2020-01-16 18:36:13,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:13,090 INFO L87 Difference]: Start difference. First operand 796 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:36:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:13,221 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-01-16 18:36:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:13,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:13,225 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:36:13,225 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:36:13,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:36:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 787. [2020-01-16 18:36:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:36:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-01-16 18:36:13,246 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-01-16 18:36:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:13,246 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-01-16 18:36:13,246 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-01-16 18:36:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:13,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:13,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:13,248 INFO L426 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash -448697609, now seen corresponding path program 559 times [2020-01-16 18:36:13,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:13,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241010615] [2020-01-16 18:36:13,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:13,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241010615] [2020-01-16 18:36:13,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:13,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:13,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691073587] [2020-01-16 18:36:13,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:13,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:13,624 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:36:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:13,785 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-01-16 18:36:13,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:13,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:13,789 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:36:13,789 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:36:13,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:36:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 797. [2020-01-16 18:36:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:36:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-01-16 18:36:13,811 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-01-16 18:36:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:13,811 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-01-16 18:36:13,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-01-16 18:36:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:13,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:13,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:13,812 INFO L426 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash 542560213, now seen corresponding path program 560 times [2020-01-16 18:36:13,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:13,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861659487] [2020-01-16 18:36:13,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:14,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861659487] [2020-01-16 18:36:14,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:14,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:14,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761756006] [2020-01-16 18:36:14,198 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:14,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:14,199 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:36:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:14,330 INFO L93 Difference]: Finished difference Result 1443 states and 5009 transitions. [2020-01-16 18:36:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:14,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:14,333 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:36:14,333 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:36:14,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:36:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 793. [2020-01-16 18:36:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-01-16 18:36:14,354 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-01-16 18:36:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:14,354 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-01-16 18:36:14,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-01-16 18:36:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:14,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:14,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:14,356 INFO L426 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -891596749, now seen corresponding path program 561 times [2020-01-16 18:36:14,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:14,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287562567] [2020-01-16 18:36:14,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:14,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287562567] [2020-01-16 18:36:14,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:14,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:14,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372597396] [2020-01-16 18:36:14,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:14,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:14,737 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:36:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:14,867 INFO L93 Difference]: Finished difference Result 1443 states and 5008 transitions. [2020-01-16 18:36:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:14,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:14,871 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:36:14,871 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:36:14,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:36:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-01-16 18:36:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3154 transitions. [2020-01-16 18:36:14,892 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3154 transitions. Word has length 25 [2020-01-16 18:36:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:14,893 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3154 transitions. [2020-01-16 18:36:14,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3154 transitions. [2020-01-16 18:36:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:14,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:14,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:14,894 INFO L426 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 120667281, now seen corresponding path program 562 times [2020-01-16 18:36:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:14,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676058588] [2020-01-16 18:36:14,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:15,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676058588] [2020-01-16 18:36:15,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:15,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:15,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92055789] [2020-01-16 18:36:15,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:15,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:15,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:15,286 INFO L87 Difference]: Start difference. First operand 798 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:36:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:15,403 INFO L93 Difference]: Finished difference Result 1448 states and 5013 transitions. [2020-01-16 18:36:15,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:15,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:15,407 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:36:15,407 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:36:15,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:36:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 793. [2020-01-16 18:36:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-01-16 18:36:15,428 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:15,428 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-01-16 18:36:15,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-01-16 18:36:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:15,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:15,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:15,430 INFO L426 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1857974071, now seen corresponding path program 563 times [2020-01-16 18:36:15,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:15,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097275551] [2020-01-16 18:36:15,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:15,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-01-16 18:36:15,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097275551] [2020-01-16 18:36:15,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:15,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:15,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263293921] [2020-01-16 18:36:15,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:15,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:15,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:15,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:15,826 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:15,966 INFO L93 Difference]: Finished difference Result 1453 states and 5025 transitions. [2020-01-16 18:36:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:15,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:15,970 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:36:15,970 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:36:15,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:36:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 802. [2020-01-16 18:36:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:36:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3156 transitions. [2020-01-16 18:36:15,992 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3156 transitions. Word has length 25 [2020-01-16 18:36:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:15,992 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3156 transitions. [2020-01-16 18:36:15,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3156 transitions. [2020-01-16 18:36:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:15,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:15,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:15,993 INFO L426 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 784888691, now seen corresponding path program 564 times [2020-01-16 18:36:15,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:15,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418293510] [2020-01-16 18:36:15,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:16,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418293510] [2020-01-16 18:36:16,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:16,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:16,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011427063] [2020-01-16 18:36:16,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:16,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:16,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:16,398 INFO L87 Difference]: Start difference. First operand 802 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:36:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:16,531 INFO L93 Difference]: Finished difference Result 1455 states and 5021 transitions. [2020-01-16 18:36:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:16,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:16,535 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:36:16,535 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:36:16,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:36:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 787. [2020-01-16 18:36:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:36:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3123 transitions. [2020-01-16 18:36:16,555 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3123 transitions. Word has length 25 [2020-01-16 18:36:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:16,555 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3123 transitions. [2020-01-16 18:36:16,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3123 transitions. [2020-01-16 18:36:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:16,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:16,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:16,556 INFO L426 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1054850743, now seen corresponding path program 565 times [2020-01-16 18:36:16,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:16,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747037753] [2020-01-16 18:36:16,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:16,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747037753] [2020-01-16 18:36:16,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:16,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:16,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001542665] [2020-01-16 18:36:16,948 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:16,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:16,948 INFO L87 Difference]: Start difference. First operand 787 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:36:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:17,087 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-01-16 18:36:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:17,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:17,090 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:36:17,090 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:36:17,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:36:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-01-16 18:36:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:36:17,112 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:36:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:17,112 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:36:17,112 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:36:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:17,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:17,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:17,114 INFO L426 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2056611669, now seen corresponding path program 566 times [2020-01-16 18:36:17,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:17,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267715581] [2020-01-16 18:36:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:17,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267715581] [2020-01-16 18:36:17,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:17,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:17,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773186035] [2020-01-16 18:36:17,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:17,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:17,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:17,504 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:36:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:17,667 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-01-16 18:36:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:17,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:17,670 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:36:17,670 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:36:17,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:36:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 792. [2020-01-16 18:36:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:36:17,691 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:17,692 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:36:17,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:36:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:17,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:17,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:17,693 INFO L426 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1314082475, now seen corresponding path program 567 times [2020-01-16 18:36:17,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:17,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123503332] [2020-01-16 18:36:17,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123503332] [2020-01-16 18:36:18,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:18,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:18,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778996867] [2020-01-16 18:36:18,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:18,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:18,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:18,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:18,078 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:18,217 INFO L93 Difference]: Finished difference Result 1437 states and 4989 transitions. [2020-01-16 18:36:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:18,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:18,221 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:36:18,221 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:36:18,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:36:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-01-16 18:36:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:36:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3146 transitions. [2020-01-16 18:36:18,242 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3146 transitions. Word has length 25 [2020-01-16 18:36:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:18,243 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3146 transitions. [2020-01-16 18:36:18,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3146 transitions. [2020-01-16 18:36:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:18,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:18,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:18,244 INFO L426 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash -301818445, now seen corresponding path program 568 times [2020-01-16 18:36:18,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:18,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703034385] [2020-01-16 18:36:18,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:18,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703034385] [2020-01-16 18:36:18,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331940672] [2020-01-16 18:36:18,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:18,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:18,632 INFO L87 Difference]: Start difference. First operand 797 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:36:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:18,752 INFO L93 Difference]: Finished difference Result 1442 states and 4994 transitions. [2020-01-16 18:36:18,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:18,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:18,755 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:36:18,756 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:36:18,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:36:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-01-16 18:36:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3132 transitions. [2020-01-16 18:36:18,777 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3132 transitions. Word has length 25 [2020-01-16 18:36:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:18,777 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3132 transitions. [2020-01-16 18:36:18,777 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3132 transitions. [2020-01-16 18:36:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:18,778 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:18,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:18,778 INFO L426 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash -922941769, now seen corresponding path program 569 times [2020-01-16 18:36:18,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:18,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567281254] [2020-01-16 18:36:18,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:19,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567281254] [2020-01-16 18:36:19,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:19,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426616613] [2020-01-16 18:36:19,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:19,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:19,163 INFO L87 Difference]: Start difference. First operand 792 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:36:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:19,306 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-01-16 18:36:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:19,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:19,309 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:36:19,309 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:36:19,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:36:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-01-16 18:36:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3143 transitions. [2020-01-16 18:36:19,330 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3143 transitions. Word has length 25 [2020-01-16 18:36:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:19,330 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3143 transitions. [2020-01-16 18:36:19,330 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3143 transitions. [2020-01-16 18:36:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:19,331 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36: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] [2020-01-16 18:36:19,332 INFO L426 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 687999189, now seen corresponding path program 570 times [2020-01-16 18:36:19,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:19,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343036710] [2020-01-16 18:36:19,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:19,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-01-16 18:36:19,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343036710] [2020-01-16 18:36:19,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:19,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:19,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994066993] [2020-01-16 18:36:19,721 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:19,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:19,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:19,722 INFO L87 Difference]: Start difference. First operand 798 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:36:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:19,881 INFO L93 Difference]: Finished difference Result 1444 states and 4993 transitions. [2020-01-16 18:36:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:19,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:19,885 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:36:19,885 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:36:19,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:36:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 787. [2020-01-16 18:36:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:36:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3118 transitions. [2020-01-16 18:36:19,906 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3118 transitions. Word has length 25 [2020-01-16 18:36:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:19,906 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3118 transitions. [2020-01-16 18:36:19,906 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3118 transitions. [2020-01-16 18:36:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:19,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:19,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:19,907 INFO L426 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash -216979789, now seen corresponding path program 571 times [2020-01-16 18:36:19,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:19,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733502042] [2020-01-16 18:36:19,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:20,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733502042] [2020-01-16 18:36:20,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:20,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:20,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747597766] [2020-01-16 18:36:20,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:20,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:20,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:20,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:20,284 INFO L87 Difference]: Start difference. First operand 787 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:36:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:20,439 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-01-16 18:36:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:20,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:20,443 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:36:20,443 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:36:20,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:36:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 799. [2020-01-16 18:36:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:36:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3151 transitions. [2020-01-16 18:36:20,466 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3151 transitions. Word has length 25 [2020-01-16 18:36:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:20,466 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3151 transitions. [2020-01-16 18:36:20,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3151 transitions. [2020-01-16 18:36:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:20,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:20,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:20,467 INFO L426 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1393961169, now seen corresponding path program 572 times [2020-01-16 18:36:20,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:20,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737958498] [2020-01-16 18:36:20,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:20,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737958498] [2020-01-16 18:36:20,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:20,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633054841] [2020-01-16 18:36:20,848 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:20,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:20,849 INFO L87 Difference]: Start difference. First operand 799 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:36:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:20,988 INFO L93 Difference]: Finished difference Result 1447 states and 5010 transitions. [2020-01-16 18:36:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:20,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:20,992 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:36:20,992 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:36:20,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:36:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 794. [2020-01-16 18:36:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:36:21,014 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:21,014 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:36:21,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:36:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:21,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:21,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:21,015 INFO L426 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1817417643, now seen corresponding path program 573 times [2020-01-16 18:36:21,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:21,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426784342] [2020-01-16 18:36:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:21,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-01-16 18:36:21,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426784342] [2020-01-16 18:36:21,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:21,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:21,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111015585] [2020-01-16 18:36:21,408 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:21,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:21,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:21,408 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:21,589 INFO L93 Difference]: Finished difference Result 1457 states and 5030 transitions. [2020-01-16 18:36:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:21,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:21,593 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:36:21,593 INFO L226 Difference]: Without dead ends: 1441 [2020-01-16 18:36:21,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-01-16 18:36:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 803. [2020-01-16 18:36:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:36:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3153 transitions. [2020-01-16 18:36:21,614 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3153 transitions. Word has length 25 [2020-01-16 18:36:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:21,614 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3153 transitions. [2020-01-16 18:36:21,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3153 transitions. [2020-01-16 18:36:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:21,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:21,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:21,615 INFO L426 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1404464273, now seen corresponding path program 574 times [2020-01-16 18:36:21,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:21,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153213612] [2020-01-16 18:36:21,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:22,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-01-16 18:36:22,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153213612] [2020-01-16 18:36:22,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:22,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:22,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500258439] [2020-01-16 18:36:22,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:22,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:22,023 INFO L87 Difference]: Start difference. First operand 803 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:36:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:22,146 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-01-16 18:36:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:22,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:22,149 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:36:22,149 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:36:22,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:36:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-01-16 18:36:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3130 transitions. [2020-01-16 18:36:22,170 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3130 transitions. Word has length 25 [2020-01-16 18:36:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:22,170 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3130 transitions. [2020-01-16 18:36:22,170 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3130 transitions. [2020-01-16 18:36:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:22,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:22,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:22,171 INFO L426 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1806914539, now seen corresponding path program 575 times [2020-01-16 18:36:22,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:22,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872215498] [2020-01-16 18:36:22,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:22,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872215498] [2020-01-16 18:36:22,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:22,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:22,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110017354] [2020-01-16 18:36:22,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:22,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:22,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:22,555 INFO L87 Difference]: Start difference. First operand 794 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:36:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:22,694 INFO L93 Difference]: Finished difference Result 1450 states and 5008 transitions. [2020-01-16 18:36:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:22,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:22,698 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:36:22,698 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:36:22,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:36:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 800. [2020-01-16 18:36:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:36:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-01-16 18:36:22,719 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-01-16 18:36:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:22,719 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-01-16 18:36:22,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-01-16 18:36:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:22,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:22,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] [2020-01-16 18:36:22,721 INFO L426 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -195973581, now seen corresponding path program 576 times [2020-01-16 18:36:22,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:22,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756913153] [2020-01-16 18:36:22,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:23,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756913153] [2020-01-16 18:36:23,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:23,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:23,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244237998] [2020-01-16 18:36:23,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:23,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:23,115 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:36:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:23,239 INFO L93 Difference]: Finished difference Result 1454 states and 5010 transitions. [2020-01-16 18:36:23,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:23,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:23,242 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:36:23,242 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:36:23,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:36:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 781. [2020-01-16 18:36:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:36:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:36:23,263 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:36:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:23,263 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:36:23,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:36:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:23,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:23,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:23,264 INFO L426 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1108890727, now seen corresponding path program 577 times [2020-01-16 18:36:23,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712620359] [2020-01-16 18:36:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:23,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-01-16 18:36:23,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712620359] [2020-01-16 18:36:23,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:23,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:23,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628401798] [2020-01-16 18:36:23,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:23,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:23,638 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:36:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:23,817 INFO L93 Difference]: Finished difference Result 1414 states and 4936 transitions. [2020-01-16 18:36:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:23,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:23,820 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:36:23,820 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:23,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-01-16 18:36:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3139 transitions. [2020-01-16 18:36:23,841 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3139 transitions. Word has length 25 [2020-01-16 18:36:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:23,841 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3139 transitions. [2020-01-16 18:36:23,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3139 transitions. [2020-01-16 18:36:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:23,842 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:23,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:23,843 INFO L426 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash 502050231, now seen corresponding path program 578 times [2020-01-16 18:36:23,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:23,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827773470] [2020-01-16 18:36:23,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:24,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827773470] [2020-01-16 18:36:24,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:24,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:24,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119208872] [2020-01-16 18:36:24,227 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:24,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:24,228 INFO L87 Difference]: Start difference. First operand 792 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:36:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:24,387 INFO L93 Difference]: Finished difference Result 1418 states and 4941 transitions. [2020-01-16 18:36:24,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:24,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:24,390 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:36:24,391 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:36:24,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:36:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 789. [2020-01-16 18:36:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3131 transitions. [2020-01-16 18:36:24,412 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3131 transitions. Word has length 25 [2020-01-16 18:36:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:24,412 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3131 transitions. [2020-01-16 18:36:24,412 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3131 transitions. [2020-01-16 18:36:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:24,413 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:24,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:24,413 INFO L426 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1585638715, now seen corresponding path program 579 times [2020-01-16 18:36:24,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:24,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856930196] [2020-01-16 18:36:24,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:24,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-01-16 18:36:24,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856930196] [2020-01-16 18:36:24,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:24,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:24,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313673673] [2020-01-16 18:36:24,775 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:24,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:24,775 INFO L87 Difference]: Start difference. First operand 789 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:36:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:24,928 INFO L93 Difference]: Finished difference Result 1412 states and 4929 transitions. [2020-01-16 18:36:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:24,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:24,932 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:36:24,932 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:36:24,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:36:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 792. [2020-01-16 18:36:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3136 transitions. [2020-01-16 18:36:24,954 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:24,954 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3136 transitions. [2020-01-16 18:36:24,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3136 transitions. [2020-01-16 18:36:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:24,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:24,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:24,955 INFO L426 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash 512553335, now seen corresponding path program 580 times [2020-01-16 18:36:24,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:24,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936883754] [2020-01-16 18:36:24,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:25,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936883754] [2020-01-16 18:36:25,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:25,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:25,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273042477] [2020-01-16 18:36:25,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:25,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:25,322 INFO L87 Difference]: Start difference. First operand 792 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:25,480 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-01-16 18:36:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:25,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:25,483 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:36:25,484 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:36:25,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:36:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 789. [2020-01-16 18:36:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3128 transitions. [2020-01-16 18:36:25,505 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3128 transitions. Word has length 25 [2020-01-16 18:36:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:25,505 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3128 transitions. [2020-01-16 18:36:25,505 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3128 transitions. [2020-01-16 18:36:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:25,506 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:25,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:25,506 INFO L426 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1596141819, now seen corresponding path program 581 times [2020-01-16 18:36:25,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:25,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248459957] [2020-01-16 18:36:25,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248459957] [2020-01-16 18:36:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:25,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:25,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813775856] [2020-01-16 18:36:25,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:25,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:25,882 INFO L87 Difference]: Start difference. First operand 789 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:36:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:26,035 INFO L93 Difference]: Finished difference Result 1422 states and 4948 transitions. [2020-01-16 18:36:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:26,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:26,039 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:36:26,039 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:36:26,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:36:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:36:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:36:26,060 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:26,060 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:36:26,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:36:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:26,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:26,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:26,061 INFO L426 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1087884519, now seen corresponding path program 582 times [2020-01-16 18:36:26,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:26,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142903746] [2020-01-16 18:36:26,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:26,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-01-16 18:36:26,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142903746] [2020-01-16 18:36:26,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:26,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:26,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097322404] [2020-01-16 18:36:26,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:26,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:26,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:26,432 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:26,592 INFO L93 Difference]: Finished difference Result 1420 states and 4939 transitions. [2020-01-16 18:36:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:26,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:26,596 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:36:26,596 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:36:26,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:36:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-01-16 18:36:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-01-16 18:36:26,618 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-01-16 18:36:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:26,618 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-01-16 18:36:26,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-01-16 18:36:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:26,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:26,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:26,619 INFO L426 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash 817143351, now seen corresponding path program 583 times [2020-01-16 18:36:26,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:26,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720426996] [2020-01-16 18:36:26,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:26,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720426996] [2020-01-16 18:36:26,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:26,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:26,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496523428] [2020-01-16 18:36:26,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:26,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:26,992 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:36:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:27,125 INFO L93 Difference]: Finished difference Result 1425 states and 4956 transitions. [2020-01-16 18:36:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:27,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:27,129 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:36:27,129 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:36:27,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:36:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 794. [2020-01-16 18:36:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-01-16 18:36:27,151 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-01-16 18:36:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:27,151 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-01-16 18:36:27,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-01-16 18:36:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:27,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:27,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:27,152 INFO L426 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1866882987, now seen corresponding path program 584 times [2020-01-16 18:36:27,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619367464] [2020-01-16 18:36:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:27,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-01-16 18:36:27,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619367464] [2020-01-16 18:36:27,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:27,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:27,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057257673] [2020-01-16 18:36:27,535 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:27,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:27,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:27,535 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:36:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:27,658 INFO L93 Difference]: Finished difference Result 1429 states and 4961 transitions. [2020-01-16 18:36:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:27,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:27,662 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:36:27,662 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:36:27,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:36:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-01-16 18:36:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3133 transitions. [2020-01-16 18:36:27,683 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3133 transitions. Word has length 25 [2020-01-16 18:36:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:27,684 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3133 transitions. [2020-01-16 18:36:27,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3133 transitions. [2020-01-16 18:36:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:27,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:27,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:27,685 INFO L426 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1911234939, now seen corresponding path program 585 times [2020-01-16 18:36:27,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:27,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009996635] [2020-01-16 18:36:27,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:28,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009996635] [2020-01-16 18:36:28,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:28,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:28,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954560395] [2020-01-16 18:36:28,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:28,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:28,048 INFO L87 Difference]: Start difference. First operand 791 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:36:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:28,169 INFO L93 Difference]: Finished difference Result 1428 states and 4958 transitions. [2020-01-16 18:36:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:28,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:28,173 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:36:28,173 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:36:28,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:36:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:36:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3140 transitions. [2020-01-16 18:36:28,195 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:28,195 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3140 transitions. [2020-01-16 18:36:28,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3140 transitions. [2020-01-16 18:36:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:28,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:28,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] [2020-01-16 18:36:28,196 INFO L426 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1845876779, now seen corresponding path program 586 times [2020-01-16 18:36:28,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:28,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527871345] [2020-01-16 18:36:28,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:28,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527871345] [2020-01-16 18:36:28,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:28,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:28,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121866205] [2020-01-16 18:36:28,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:28,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:28,567 INFO L87 Difference]: Start difference. First operand 795 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:28,688 INFO L93 Difference]: Finished difference Result 1434 states and 4966 transitions. [2020-01-16 18:36:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:28,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:28,692 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:36:28,692 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:36:28,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:36:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-01-16 18:36:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3129 transitions. [2020-01-16 18:36:28,712 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3129 transitions. Word has length 25 [2020-01-16 18:36:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:28,713 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3129 transitions. [2020-01-16 18:36:28,713 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3129 transitions. [2020-01-16 18:36:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:28,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:28,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:28,714 INFO L426 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:28,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1921738043, now seen corresponding path program 587 times [2020-01-16 18:36:28,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:28,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691699492] [2020-01-16 18:36:28,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:29,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691699492] [2020-01-16 18:36:29,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:29,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:29,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601529592] [2020-01-16 18:36:29,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:29,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:29,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:29,090 INFO L87 Difference]: Start difference. First operand 791 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:36:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:29,233 INFO L93 Difference]: Finished difference Result 1441 states and 4983 transitions. [2020-01-16 18:36:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:29,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:29,237 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:36:29,237 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:36:29,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:36:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 800. [2020-01-16 18:36:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:36:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3145 transitions. [2020-01-16 18:36:29,258 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3145 transitions. Word has length 25 [2020-01-16 18:36:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:29,258 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3145 transitions. [2020-01-16 18:36:29,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3145 transitions. [2020-01-16 18:36:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:29,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:29,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:29,259 INFO L426 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 848652663, now seen corresponding path program 588 times [2020-01-16 18:36:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:29,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644558094] [2020-01-16 18:36:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:29,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-01-16 18:36:29,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644558094] [2020-01-16 18:36:29,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:29,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:29,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145528904] [2020-01-16 18:36:29,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:29,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:29,648 INFO L87 Difference]: Start difference. First operand 800 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:36:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:29,758 INFO L93 Difference]: Finished difference Result 1443 states and 4979 transitions. [2020-01-16 18:36:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:29,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:29,762 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:36:29,762 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:36:29,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:36:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2020-01-16 18:36:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3115 transitions. [2020-01-16 18:36:29,782 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3115 transitions. Word has length 25 [2020-01-16 18:36:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:29,783 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3115 transitions. [2020-01-16 18:36:29,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3115 transitions. [2020-01-16 18:36:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:29,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:29,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:29,784 INFO L426 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1142739575, now seen corresponding path program 589 times [2020-01-16 18:36:29,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:29,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452603115] [2020-01-16 18:36:29,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452603115] [2020-01-16 18:36:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:30,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061766879] [2020-01-16 18:36:30,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:30,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:30,158 INFO L87 Difference]: Start difference. First operand 786 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:36:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:30,305 INFO L93 Difference]: Finished difference Result 1417 states and 4934 transitions. [2020-01-16 18:36:30,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:30,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:30,309 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:36:30,309 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:36:30,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:36:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 793. [2020-01-16 18:36:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3134 transitions. [2020-01-16 18:36:30,330 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3134 transitions. Word has length 25 [2020-01-16 18:36:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:30,330 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3134 transitions. [2020-01-16 18:36:30,330 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3134 transitions. [2020-01-16 18:36:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:30,331 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:30,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:30,331 INFO L426 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 69654195, now seen corresponding path program 590 times [2020-01-16 18:36:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562830168] [2020-01-16 18:36:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:30,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562830168] [2020-01-16 18:36:30,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:30,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:30,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888131859] [2020-01-16 18:36:30,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:30,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:30,715 INFO L87 Difference]: Start difference. First operand 793 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:36:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:30,854 INFO L93 Difference]: Finished difference Result 1419 states and 4935 transitions. [2020-01-16 18:36:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:30,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:30,857 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:36:30,858 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:30,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:36:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:36:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3126 transitions. [2020-01-16 18:36:30,879 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3126 transitions. Word has length 25 [2020-01-16 18:36:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:30,879 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3126 transitions. [2020-01-16 18:36:30,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3126 transitions. [2020-01-16 18:36:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:30,880 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:30,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:30,880 INFO L426 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -457698279, now seen corresponding path program 591 times [2020-01-16 18:36:30,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:30,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689253450] [2020-01-16 18:36:30,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:31,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689253450] [2020-01-16 18:36:31,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:31,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:31,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081056174] [2020-01-16 18:36:31,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:31,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:31,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:31,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:31,244 INFO L87 Difference]: Start difference. First operand 790 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:36:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:31,380 INFO L93 Difference]: Finished difference Result 1422 states and 4940 transitions. [2020-01-16 18:36:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:31,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:31,383 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:36:31,384 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:36:31,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:36:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-01-16 18:36:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-01-16 18:36:31,415 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-01-16 18:36:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:31,415 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-01-16 18:36:31,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-01-16 18:36:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:31,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:31,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:31,417 INFO L426 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:31,417 INFO L82 PathProgramCache]: Analyzing trace with hash 80157299, now seen corresponding path program 592 times [2020-01-16 18:36:31,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:31,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238569293] [2020-01-16 18:36:31,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:31,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238569293] [2020-01-16 18:36:31,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:31,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:31,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266597671] [2020-01-16 18:36:31,804 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:31,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:31,804 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:36:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:31,919 INFO L93 Difference]: Finished difference Result 1428 states and 4948 transitions. [2020-01-16 18:36:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:31,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:31,923 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:36:31,923 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:36:31,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:36:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 790. [2020-01-16 18:36:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:36:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3122 transitions. [2020-01-16 18:36:31,948 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3122 transitions. Word has length 25 [2020-01-16 18:36:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:31,949 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3122 transitions. [2020-01-16 18:36:31,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3122 transitions. [2020-01-16 18:36:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:31,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:31,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:31,950 INFO L426 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash -436692071, now seen corresponding path program 593 times [2020-01-16 18:36:31,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:31,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323931906] [2020-01-16 18:36:31,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:32,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323931906] [2020-01-16 18:36:32,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:32,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455309786] [2020-01-16 18:36:32,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:32,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:32,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:32,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:32,344 INFO L87 Difference]: Start difference. First operand 790 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:36:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:32,469 INFO L93 Difference]: Finished difference Result 1428 states and 4950 transitions. [2020-01-16 18:36:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:32,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:32,472 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:36:32,472 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:36:32,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:36:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-01-16 18:36:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3133 transitions. [2020-01-16 18:36:32,494 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3133 transitions. Word has length 25 [2020-01-16 18:36:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:32,494 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3133 transitions. [2020-01-16 18:36:32,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3133 transitions. [2020-01-16 18:36:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:32,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:32,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:32,496 INFO L426 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1174248887, now seen corresponding path program 594 times [2020-01-16 18:36:32,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:32,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010014951] [2020-01-16 18:36:32,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:32,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010014951] [2020-01-16 18:36:32,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:32,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:32,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860400006] [2020-01-16 18:36:32,875 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:32,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:32,875 INFO L87 Difference]: Start difference. First operand 796 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:36:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:33,005 INFO L93 Difference]: Finished difference Result 1432 states and 4952 transitions. [2020-01-16 18:36:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:33,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:33,009 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:36:33,009 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:36:33,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:36:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 786. [2020-01-16 18:36:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3111 transitions. [2020-01-16 18:36:33,030 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3111 transitions. Word has length 25 [2020-01-16 18:36:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:33,030 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3111 transitions. [2020-01-16 18:36:33,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3111 transitions. [2020-01-16 18:36:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:33,031 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:33,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:33,032 INFO L426 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1215690539, now seen corresponding path program 595 times [2020-01-16 18:36:33,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:33,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766481788] [2020-01-16 18:36:33,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:33,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766481788] [2020-01-16 18:36:33,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:33,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:33,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910440197] [2020-01-16 18:36:33,409 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:33,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:33,409 INFO L87 Difference]: Start difference. First operand 786 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:36:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:33,535 INFO L93 Difference]: Finished difference Result 1441 states and 4989 transitions. [2020-01-16 18:36:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:33,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:33,539 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:36:33,539 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:36:33,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:36:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 798. [2020-01-16 18:36:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-01-16 18:36:33,560 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-01-16 18:36:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:33,560 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-01-16 18:36:33,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-01-16 18:36:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:33,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:33,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:33,562 INFO L426 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 395250419, now seen corresponding path program 596 times [2020-01-16 18:36:33,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:33,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800305831] [2020-01-16 18:36:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:33,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-01-16 18:36:33,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800305831] [2020-01-16 18:36:33,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:33,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:33,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72390054] [2020-01-16 18:36:33,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:33,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:33,967 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:36:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:34,110 INFO L93 Difference]: Finished difference Result 1439 states and 4980 transitions. [2020-01-16 18:36:34,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:34,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:34,114 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:36:34,114 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:36:34,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:36:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 793. [2020-01-16 18:36:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-01-16 18:36:34,136 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-01-16 18:36:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:34,136 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-01-16 18:36:34,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-01-16 18:36:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:34,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:34,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:34,137 INFO L426 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1478838903, now seen corresponding path program 597 times [2020-01-16 18:36:34,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:34,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513120388] [2020-01-16 18:36:34,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:34,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513120388] [2020-01-16 18:36:34,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:34,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:34,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569629322] [2020-01-16 18:36:34,516 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:34,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:34,517 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:36:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:34,649 INFO L93 Difference]: Finished difference Result 1449 states and 5000 transitions. [2020-01-16 18:36:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:34,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:34,653 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:36:34,653 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:36:34,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:36:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-01-16 18:36:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:36:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3146 transitions. [2020-01-16 18:36:34,675 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3146 transitions. Word has length 25 [2020-01-16 18:36:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:34,675 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3146 transitions. [2020-01-16 18:36:34,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3146 transitions. [2020-01-16 18:36:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:34,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:34,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] [2020-01-16 18:36:34,676 INFO L426 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash 405753523, now seen corresponding path program 598 times [2020-01-16 18:36:34,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:34,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403780255] [2020-01-16 18:36:34,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:35,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403780255] [2020-01-16 18:36:35,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:35,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:35,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436182220] [2020-01-16 18:36:35,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:35,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:35,067 INFO L87 Difference]: Start difference. First operand 802 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:36:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:35,174 INFO L93 Difference]: Finished difference Result 1451 states and 4996 transitions. [2020-01-16 18:36:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:35,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:35,178 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:36:35,178 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:36:35,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:36:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-01-16 18:36:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3123 transitions. [2020-01-16 18:36:35,199 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3123 transitions. Word has length 25 [2020-01-16 18:36:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:35,199 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3123 transitions. [2020-01-16 18:36:35,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3123 transitions. [2020-01-16 18:36:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:35,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:35,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] [2020-01-16 18:36:35,200 INFO L426 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1489342007, now seen corresponding path program 599 times [2020-01-16 18:36:35,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:35,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715652801] [2020-01-16 18:36:35,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:35,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-01-16 18:36:35,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715652801] [2020-01-16 18:36:35,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:35,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:35,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111377038] [2020-01-16 18:36:35,586 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:35,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:35,586 INFO L87 Difference]: Start difference. First operand 793 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:36:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:35,737 INFO L93 Difference]: Finished difference Result 1442 states and 4978 transitions. [2020-01-16 18:36:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:35,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:35,741 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:36:35,741 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:36:35,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:36:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 799. [2020-01-16 18:36:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:36:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3134 transitions. [2020-01-16 18:36:35,762 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3134 transitions. Word has length 25 [2020-01-16 18:36:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:35,762 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3134 transitions. [2020-01-16 18:36:35,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3134 transitions. [2020-01-16 18:36:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:35,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:35,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:35,763 INFO L426 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1194684331, now seen corresponding path program 600 times [2020-01-16 18:36:35,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:35,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386647150] [2020-01-16 18:36:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:36,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386647150] [2020-01-16 18:36:36,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:36,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:36,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873960537] [2020-01-16 18:36:36,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:36,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:36,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:36,153 INFO L87 Difference]: Start difference. First operand 799 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:36:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:36,272 INFO L93 Difference]: Finished difference Result 1446 states and 4980 transitions. [2020-01-16 18:36:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:36,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:36,276 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:36:36,276 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:36:36,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:36:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 776. [2020-01-16 18:36:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:36:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3088 transitions. [2020-01-16 18:36:36,298 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3088 transitions. Word has length 25 [2020-01-16 18:36:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:36,298 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3088 transitions. [2020-01-16 18:36:36,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3088 transitions. [2020-01-16 18:36:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:36,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:36,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:36,299 INFO L426 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2008365005, now seen corresponding path program 601 times [2020-01-16 18:36:36,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:36,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039221210] [2020-01-16 18:36:36,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:36,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039221210] [2020-01-16 18:36:36,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:36,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:36,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460829635] [2020-01-16 18:36:36,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:36,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:36,674 INFO L87 Difference]: Start difference. First operand 776 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:36:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:36,805 INFO L93 Difference]: Finished difference Result 1421 states and 4973 transitions. [2020-01-16 18:36:36,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:36,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:36,809 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:36:36,809 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:36:36,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:36:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 792. [2020-01-16 18:36:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:36:36,831 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:36:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:36,831 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:36:36,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:36:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:36,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:36,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:36,832 INFO L426 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -397424047, now seen corresponding path program 602 times [2020-01-16 18:36:36,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:36,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004435169] [2020-01-16 18:36:36,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:37,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004435169] [2020-01-16 18:36:37,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:37,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445801544] [2020-01-16 18:36:37,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:37,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:37,232 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:36:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:37,361 INFO L93 Difference]: Finished difference Result 1418 states and 4964 transitions. [2020-01-16 18:36:37,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:37,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:37,365 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:36:37,365 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:36:37,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:36:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 789. [2020-01-16 18:36:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-01-16 18:36:37,385 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-01-16 18:36:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:37,385 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-01-16 18:36:37,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-01-16 18:36:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:37,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:37,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:37,387 INFO L426 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash 686164437, now seen corresponding path program 603 times [2020-01-16 18:36:37,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:37,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788710674] [2020-01-16 18:36:37,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:37,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788710674] [2020-01-16 18:36:37,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:37,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:37,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255719658] [2020-01-16 18:36:37,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:37,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:37,764 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:36:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:37,888 INFO L93 Difference]: Finished difference Result 1428 states and 4987 transitions. [2020-01-16 18:36:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:37,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:37,892 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:36:37,892 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:36:37,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:36:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 795. [2020-01-16 18:36:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3152 transitions. [2020-01-16 18:36:37,914 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3152 transitions. Word has length 25 [2020-01-16 18:36:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:37,914 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3152 transitions. [2020-01-16 18:36:37,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3152 transitions. [2020-01-16 18:36:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:37,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:37,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:37,915 INFO L426 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -386920943, now seen corresponding path program 604 times [2020-01-16 18:36:37,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:37,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710069078] [2020-01-16 18:36:37,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:38,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-01-16 18:36:38,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710069078] [2020-01-16 18:36:38,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:38,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:38,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578013999] [2020-01-16 18:36:38,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:38,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:38,290 INFO L87 Difference]: Start difference. First operand 795 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:36:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:38,423 INFO L93 Difference]: Finished difference Result 1429 states and 4983 transitions. [2020-01-16 18:36:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:38,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:38,426 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:36:38,426 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:36:38,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:36:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 789. [2020-01-16 18:36:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-01-16 18:36:38,447 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-01-16 18:36:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:38,447 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-01-16 18:36:38,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-01-16 18:36:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:38,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:38,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:38,448 INFO L426 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash 696667541, now seen corresponding path program 605 times [2020-01-16 18:36:38,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:38,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620048149] [2020-01-16 18:36:38,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:38,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-01-16 18:36:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620048149] [2020-01-16 18:36:38,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:38,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145041040] [2020-01-16 18:36:38,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:38,826 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:36:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:38,945 INFO L93 Difference]: Finished difference Result 1419 states and 4963 transitions. [2020-01-16 18:36:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:38,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:38,949 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:36:38,949 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:36:38,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:36:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 792. [2020-01-16 18:36:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3143 transitions. [2020-01-16 18:36:38,969 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3143 transitions. Word has length 25 [2020-01-16 18:36:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:38,970 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3143 transitions. [2020-01-16 18:36:38,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3143 transitions. [2020-01-16 18:36:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:38,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:38,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:38,971 INFO L426 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358797, now seen corresponding path program 606 times [2020-01-16 18:36:38,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:38,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526284304] [2020-01-16 18:36:38,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:39,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526284304] [2020-01-16 18:36:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:39,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:39,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281151888] [2020-01-16 18:36:39,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:39,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:39,346 INFO L87 Difference]: Start difference. First operand 792 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:36:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:39,482 INFO L93 Difference]: Finished difference Result 1423 states and 4968 transitions. [2020-01-16 18:36:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:39,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:39,486 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:36:39,486 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:36:39,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:36:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 786. [2020-01-16 18:36:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-01-16 18:36:39,508 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-01-16 18:36:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:39,508 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-01-16 18:36:39,508 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-01-16 18:36:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:39,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:39,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] [2020-01-16 18:36:39,509 INFO L426 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -82330927, now seen corresponding path program 607 times [2020-01-16 18:36:39,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992088797] [2020-01-16 18:36:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:39,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992088797] [2020-01-16 18:36:39,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:39,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:39,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021754627] [2020-01-16 18:36:39,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:39,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:39,884 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:36:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:40,029 INFO L93 Difference]: Finished difference Result 1418 states and 4963 transitions. [2020-01-16 18:36:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:40,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:40,033 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:36:40,033 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:36:40,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:36:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-01-16 18:36:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-01-16 18:36:40,074 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-01-16 18:36:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:40,074 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-01-16 18:36:40,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-01-16 18:36:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:40,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:40,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:40,076 INFO L426 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1528610031, now seen corresponding path program 608 times [2020-01-16 18:36:40,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:40,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978678312] [2020-01-16 18:36:40,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:40,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-01-16 18:36:40,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978678312] [2020-01-16 18:36:40,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:40,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:40,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985350657] [2020-01-16 18:36:40,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:40,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:40,446 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:36:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:40,600 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-01-16 18:36:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:40,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:40,604 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:36:40,604 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:36:40,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:36:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-01-16 18:36:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-01-16 18:36:40,626 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-01-16 18:36:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:40,626 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-01-16 18:36:40,626 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-01-16 18:36:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:40,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:40,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:40,627 INFO L426 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1011760661, now seen corresponding path program 609 times [2020-01-16 18:36:40,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:40,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562634787] [2020-01-16 18:36:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:41,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-01-16 18:36:41,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562634787] [2020-01-16 18:36:41,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:41,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:41,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887274284] [2020-01-16 18:36:41,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:41,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:41,015 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:36:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:41,171 INFO L93 Difference]: Finished difference Result 1422 states and 4970 transitions. [2020-01-16 18:36:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:41,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:41,174 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:36:41,175 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:36:41,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:36:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 794. [2020-01-16 18:36:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-01-16 18:36:41,195 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-01-16 18:36:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:41,195 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-01-16 18:36:41,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-01-16 18:36:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:41,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:41,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:41,197 INFO L426 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616239, now seen corresponding path program 610 times [2020-01-16 18:36:41,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:41,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508542017] [2020-01-16 18:36:41,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:41,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508542017] [2020-01-16 18:36:41,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:41,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:41,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498638673] [2020-01-16 18:36:41,570 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:41,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:41,570 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:36:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:41,712 INFO L93 Difference]: Finished difference Result 1421 states and 4963 transitions. [2020-01-16 18:36:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:41,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:41,715 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:36:41,715 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:41,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-01-16 18:36:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3135 transitions. [2020-01-16 18:36:41,736 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3135 transitions. Word has length 25 [2020-01-16 18:36:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:41,736 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3135 transitions. [2020-01-16 18:36:41,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3135 transitions. [2020-01-16 18:36:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:41,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:41,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:41,737 INFO L426 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1022263765, now seen corresponding path program 611 times [2020-01-16 18:36:41,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:41,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644645797] [2020-01-16 18:36:41,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644645797] [2020-01-16 18:36:42,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:42,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:42,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040737387] [2020-01-16 18:36:42,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:42,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:42,107 INFO L87 Difference]: Start difference. First operand 789 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:36:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:42,249 INFO L93 Difference]: Finished difference Result 1414 states and 4949 transitions. [2020-01-16 18:36:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:42,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:42,253 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:36:42,253 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:42,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-01-16 18:36:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-01-16 18:36:42,274 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:42,274 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-01-16 18:36:42,274 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-01-16 18:36:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:42,275 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:42,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:42,275 INFO L426 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -50821615, now seen corresponding path program 612 times [2020-01-16 18:36:42,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:42,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297032988] [2020-01-16 18:36:42,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:42,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297032988] [2020-01-16 18:36:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:42,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223970109] [2020-01-16 18:36:42,646 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:42,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:42,646 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:42,799 INFO L93 Difference]: Finished difference Result 1416 states and 4950 transitions. [2020-01-16 18:36:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:42,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:42,802 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:36:42,802 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:36:42,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:36:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-01-16 18:36:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3127 transitions. [2020-01-16 18:36:42,823 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3127 transitions. Word has length 25 [2020-01-16 18:36:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:42,823 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3127 transitions. [2020-01-16 18:36:42,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3127 transitions. [2020-01-16 18:36:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:42,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:42,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:42,825 INFO L426 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 243265297, now seen corresponding path program 613 times [2020-01-16 18:36:42,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:42,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70245863] [2020-01-16 18:36:42,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:43,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70245863] [2020-01-16 18:36:43,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:43,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:43,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8936682] [2020-01-16 18:36:43,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:43,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:43,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:43,227 INFO L87 Difference]: Start difference. First operand 786 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:36:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:43,358 INFO L93 Difference]: Finished difference Result 1436 states and 5008 transitions. [2020-01-16 18:36:43,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:43,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:43,361 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:36:43,361 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:36:43,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:36:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 797. [2020-01-16 18:36:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:36:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3157 transitions. [2020-01-16 18:36:43,382 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3157 transitions. Word has length 25 [2020-01-16 18:36:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:43,383 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3157 transitions. [2020-01-16 18:36:43,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3157 transitions. [2020-01-16 18:36:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:43,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:43,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:43,384 INFO L426 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:43,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash -829820083, now seen corresponding path program 614 times [2020-01-16 18:36:43,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:43,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931921700] [2020-01-16 18:36:43,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:43,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931921700] [2020-01-16 18:36:43,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:43,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:43,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674515050] [2020-01-16 18:36:43,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:43,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:43,763 INFO L87 Difference]: Start difference. First operand 797 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:36:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:43,908 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-01-16 18:36:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:43,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:43,912 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:36:43,912 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:36:43,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:36:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-01-16 18:36:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3141 transitions. [2020-01-16 18:36:43,934 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3141 transitions. Word has length 25 [2020-01-16 18:36:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:43,934 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3141 transitions. [2020-01-16 18:36:43,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3141 transitions. [2020-01-16 18:36:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:43,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:43,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:43,935 INFO L426 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1357172557, now seen corresponding path program 615 times [2020-01-16 18:36:43,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:43,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262117916] [2020-01-16 18:36:43,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:44,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-01-16 18:36:44,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262117916] [2020-01-16 18:36:44,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:44,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:44,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169266555] [2020-01-16 18:36:44,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:44,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:44,317 INFO L87 Difference]: Start difference. First operand 791 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:36:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:44,468 INFO L93 Difference]: Finished difference Result 1433 states and 4996 transitions. [2020-01-16 18:36:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:44,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:44,471 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:36:44,471 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:36:44,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:36:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-01-16 18:36:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3150 transitions. [2020-01-16 18:36:44,493 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3150 transitions. Word has length 25 [2020-01-16 18:36:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:44,493 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3150 transitions. [2020-01-16 18:36:44,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3150 transitions. [2020-01-16 18:36:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:44,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:44,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:44,495 INFO L426 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash -819316979, now seen corresponding path program 616 times [2020-01-16 18:36:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:44,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631109122] [2020-01-16 18:36:44,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:44,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-01-16 18:36:44,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631109122] [2020-01-16 18:36:44,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:44,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:44,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052040062] [2020-01-16 18:36:44,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:44,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:44,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:44,877 INFO L87 Difference]: Start difference. First operand 796 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:36:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:45,024 INFO L93 Difference]: Finished difference Result 1432 states and 4989 transitions. [2020-01-16 18:36:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:45,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:45,028 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:36:45,028 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:36:45,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:36:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 791. [2020-01-16 18:36:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:36:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-01-16 18:36:45,049 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:45,049 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-01-16 18:36:45,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-01-16 18:36:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:45,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:45,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] [2020-01-16 18:36:45,050 INFO L426 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1336166349, now seen corresponding path program 617 times [2020-01-16 18:36:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:45,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906014121] [2020-01-16 18:36:45,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:45,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-01-16 18:36:45,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906014121] [2020-01-16 18:36:45,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:45,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:45,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458624786] [2020-01-16 18:36:45,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:45,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:45,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:45,425 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:45,576 INFO L93 Difference]: Finished difference Result 1435 states and 4995 transitions. [2020-01-16 18:36:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:45,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:45,580 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:36:45,580 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:36:45,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:36:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-01-16 18:36:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-01-16 18:36:45,601 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-01-16 18:36:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:45,601 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-01-16 18:36:45,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-01-16 18:36:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:45,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:45,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:45,602 INFO L426 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 274774609, now seen corresponding path program 618 times [2020-01-16 18:36:45,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:45,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887340392] [2020-01-16 18:36:45,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:45,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887340392] [2020-01-16 18:36:45,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:45,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:45,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127389234] [2020-01-16 18:36:45,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:45,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:45,995 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:36:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:46,140 INFO L93 Difference]: Finished difference Result 1433 states and 4986 transitions. [2020-01-16 18:36:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:46,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:46,144 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:36:46,144 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:36:46,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:36:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 786. [2020-01-16 18:36:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:36:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3124 transitions. [2020-01-16 18:36:46,165 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3124 transitions. Word has length 25 [2020-01-16 18:36:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:46,165 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3124 transitions. [2020-01-16 18:36:46,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3124 transitions. [2020-01-16 18:36:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:46,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:46,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:46,167 INFO L426 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2115164817, now seen corresponding path program 619 times [2020-01-16 18:36:46,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:46,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040186026] [2020-01-16 18:36:46,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:46,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040186026] [2020-01-16 18:36:46,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:46,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89838545] [2020-01-16 18:36:46,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:46,555 INFO L87 Difference]: Start difference. First operand 786 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:36:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:46,685 INFO L93 Difference]: Finished difference Result 1417 states and 4955 transitions. [2020-01-16 18:36:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:46,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:46,689 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:36:46,689 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:36:46,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:36:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 792. [2020-01-16 18:36:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-01-16 18:36:46,710 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-01-16 18:36:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:46,710 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-01-16 18:36:46,710 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-01-16 18:36:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:46,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:46,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:46,711 INFO L426 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -504223859, now seen corresponding path program 620 times [2020-01-16 18:36:46,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:46,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839447466] [2020-01-16 18:36:46,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:47,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839447466] [2020-01-16 18:36:47,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:47,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:47,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285421538] [2020-01-16 18:36:47,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:47,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:47,074 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:36:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:47,226 INFO L93 Difference]: Finished difference Result 1421 states and 4960 transitions. [2020-01-16 18:36:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:47,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:47,229 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:36:47,229 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:36:47,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:36:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-01-16 18:36:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-01-16 18:36:47,251 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-01-16 18:36:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:47,251 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-01-16 18:36:47,251 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-01-16 18:36:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:47,252 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:47,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:47,252 INFO L426 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 579364625, now seen corresponding path program 621 times [2020-01-16 18:36:47,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:47,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324718664] [2020-01-16 18:36:47,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:47,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324718664] [2020-01-16 18:36:47,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:47,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:47,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085239651] [2020-01-16 18:36:47,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:47,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:47,622 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:36:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:47,768 INFO L93 Difference]: Finished difference Result 1415 states and 4948 transitions. [2020-01-16 18:36:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:47,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:47,772 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:36:47,772 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:36:47,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:36:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-01-16 18:36:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:36:47,793 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:36:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:47,793 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:36:47,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:36:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:47,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:47,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:47,794 INFO L426 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -493720755, now seen corresponding path program 622 times [2020-01-16 18:36:47,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:47,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020214476] [2020-01-16 18:36:47,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:48,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020214476] [2020-01-16 18:36:48,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:48,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:48,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669244053] [2020-01-16 18:36:48,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:48,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:48,158 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:36:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:48,294 INFO L93 Difference]: Finished difference Result 1417 states and 4949 transitions. [2020-01-16 18:36:48,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:48,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:48,297 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:36:48,297 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:36:48,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:36:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-01-16 18:36:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-01-16 18:36:48,318 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-01-16 18:36:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:48,318 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-01-16 18:36:48,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-01-16 18:36:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:48,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:48,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:48,319 INFO L426 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash 589867729, now seen corresponding path program 623 times [2020-01-16 18:36:48,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:48,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790849188] [2020-01-16 18:36:48,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790849188] [2020-01-16 18:36:48,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:48,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:48,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233280285] [2020-01-16 18:36:48,684 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:48,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:48,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:48,685 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:36:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:48,828 INFO L93 Difference]: Finished difference Result 1425 states and 4967 transitions. [2020-01-16 18:36:48,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:48,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:48,832 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:36:48,832 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:36:48,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:36:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-01-16 18:36:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:36:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-01-16 18:36:48,852 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-01-16 18:36:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:48,853 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-01-16 18:36:48,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-01-16 18:36:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:48,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:48,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] [2020-01-16 18:36:48,854 INFO L426 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2094158609, now seen corresponding path program 624 times [2020-01-16 18:36:48,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:48,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692754106] [2020-01-16 18:36:48,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:49,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692754106] [2020-01-16 18:36:49,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:49,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:49,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775068416] [2020-01-16 18:36:49,224 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:49,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:49,224 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:36:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:49,367 INFO L93 Difference]: Finished difference Result 1423 states and 4958 transitions. [2020-01-16 18:36:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:49,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:49,371 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:36:49,371 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:36:49,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:36:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 783. [2020-01-16 18:36:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:36:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:36:49,392 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:36:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:49,392 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:36:49,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:36:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:49,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:49,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:49,393 INFO L426 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1864116565, now seen corresponding path program 625 times [2020-01-16 18:36:49,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:49,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657856385] [2020-01-16 18:36:49,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:49,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-01-16 18:36:49,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657856385] [2020-01-16 18:36:49,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:49,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:49,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310340668] [2020-01-16 18:36:49,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:49,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:49,785 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:36:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:49,933 INFO L93 Difference]: Finished difference Result 1442 states and 5020 transitions. [2020-01-16 18:36:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:49,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:49,937 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:36:49,937 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:36:49,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:36:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 795. [2020-01-16 18:36:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:36:49,958 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:36:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:49,959 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:36:49,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:36:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:49,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:49,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:49,960 INFO L426 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash -819909773, now seen corresponding path program 626 times [2020-01-16 18:36:49,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:49,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039343382] [2020-01-16 18:36:49,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:50,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039343382] [2020-01-16 18:36:50,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:50,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:50,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212774647] [2020-01-16 18:36:50,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:50,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:50,339 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:36:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:50,493 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-01-16 18:36:50,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:50,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:50,497 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:36:50,497 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:36:50,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:36:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-01-16 18:36:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:36:50,519 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:36:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:50,519 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:36:50,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:36:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:50,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:50,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:50,520 INFO L426 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 263678711, now seen corresponding path program 627 times [2020-01-16 18:36:50,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:50,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974121298] [2020-01-16 18:36:50,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:50,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-01-16 18:36:50,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974121298] [2020-01-16 18:36:50,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:50,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:50,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975889285] [2020-01-16 18:36:50,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:50,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:50,900 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:36:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:51,037 INFO L93 Difference]: Finished difference Result 1449 states and 5034 transitions. [2020-01-16 18:36:51,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:51,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:51,041 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:36:51,041 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:36:51,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:36:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 798. [2020-01-16 18:36:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3158 transitions. [2020-01-16 18:36:51,064 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3158 transitions. Word has length 25 [2020-01-16 18:36:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:51,064 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3158 transitions. [2020-01-16 18:36:51,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3158 transitions. [2020-01-16 18:36:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:51,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:51,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:51,065 INFO L426 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -809406669, now seen corresponding path program 628 times [2020-01-16 18:36:51,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:51,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122866245] [2020-01-16 18:36:51,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:51,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-01-16 18:36:51,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122866245] [2020-01-16 18:36:51,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:51,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:51,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708071657] [2020-01-16 18:36:51,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:51,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:51,455 INFO L87 Difference]: Start difference. First operand 798 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:36:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:51,612 INFO L93 Difference]: Finished difference Result 1450 states and 5030 transitions. [2020-01-16 18:36:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:51,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:51,615 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:36:51,615 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:36:51,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:36:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 792. [2020-01-16 18:36:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:36:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-01-16 18:36:51,636 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-01-16 18:36:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:51,636 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-01-16 18:36:51,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-01-16 18:36:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:51,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:51,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:51,637 INFO L426 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 274181815, now seen corresponding path program 629 times [2020-01-16 18:36:51,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:51,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006898520] [2020-01-16 18:36:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:52,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006898520] [2020-01-16 18:36:52,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:52,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:52,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561507458] [2020-01-16 18:36:52,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:52,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:52,020 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:36:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:52,168 INFO L93 Difference]: Finished difference Result 1440 states and 5010 transitions. [2020-01-16 18:36:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:52,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:52,172 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:36:52,172 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:36:52,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:36:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 795. [2020-01-16 18:36:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:36:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3149 transitions. [2020-01-16 18:36:52,194 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3149 transitions. Word has length 25 [2020-01-16 18:36:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:52,194 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3149 transitions. [2020-01-16 18:36:52,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3149 transitions. [2020-01-16 18:36:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:52,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:52,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:52,195 INFO L426 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1885122773, now seen corresponding path program 630 times [2020-01-16 18:36:52,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:52,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091540620] [2020-01-16 18:36:52,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:52,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-01-16 18:36:52,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091540620] [2020-01-16 18:36:52,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:52,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:52,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345621826] [2020-01-16 18:36:52,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:52,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:52,574 INFO L87 Difference]: Start difference. First operand 795 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:36:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:52,708 INFO L93 Difference]: Finished difference Result 1444 states and 5015 transitions. [2020-01-16 18:36:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:52,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:52,711 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:36:52,712 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:36:52,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:36:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 789. [2020-01-16 18:36:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-01-16 18:36:52,733 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-01-16 18:36:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:52,733 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-01-16 18:36:52,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-01-16 18:36:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:52,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:52,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:52,735 INFO L426 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1421217425, now seen corresponding path program 631 times [2020-01-16 18:36:52,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:52,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264601911] [2020-01-16 18:36:52,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:53,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264601911] [2020-01-16 18:36:53,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:53,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:53,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840451754] [2020-01-16 18:36:53,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:53,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:53,139 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:36:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:53,292 INFO L93 Difference]: Finished difference Result 1447 states and 5027 transitions. [2020-01-16 18:36:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:53,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:53,296 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:36:53,296 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:36:53,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:36:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 796. [2020-01-16 18:36:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:36:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3155 transitions. [2020-01-16 18:36:53,317 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3155 transitions. Word has length 25 [2020-01-16 18:36:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:53,317 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3155 transitions. [2020-01-16 18:36:53,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3155 transitions. [2020-01-16 18:36:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:53,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:53,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:53,318 INFO L426 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1262808913, now seen corresponding path program 632 times [2020-01-16 18:36:53,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:53,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260269932] [2020-01-16 18:36:53,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:53,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260269932] [2020-01-16 18:36:53,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:53,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:53,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979077629] [2020-01-16 18:36:53,710 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:53,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:53,710 INFO L87 Difference]: Start difference. First operand 796 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:36:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:53,850 INFO L93 Difference]: Finished difference Result 1444 states and 5018 transitions. [2020-01-16 18:36:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:53,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:53,853 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:36:53,853 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:36:53,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:36:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-01-16 18:36:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3147 transitions. [2020-01-16 18:36:53,875 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3147 transitions. Word has length 25 [2020-01-16 18:36:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:53,875 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3147 transitions. [2020-01-16 18:36:53,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3147 transitions. [2020-01-16 18:36:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:53,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:53,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:53,876 INFO L426 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 914871159, now seen corresponding path program 633 times [2020-01-16 18:36:53,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:53,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807196965] [2020-01-16 18:36:53,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807196965] [2020-01-16 18:36:54,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:54,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:54,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805728481] [2020-01-16 18:36:54,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:54,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:54,258 INFO L87 Difference]: Start difference. First operand 793 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:36:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:54,407 INFO L93 Difference]: Finished difference Result 1457 states and 5046 transitions. [2020-01-16 18:36:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:54,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:54,411 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:36:54,411 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:36:54,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:36:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 800. [2020-01-16 18:36:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:36:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3160 transitions. [2020-01-16 18:36:54,434 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3160 transitions. Word has length 25 [2020-01-16 18:36:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:54,434 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3160 transitions. [2020-01-16 18:36:54,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3160 transitions. [2020-01-16 18:36:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:54,435 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:54,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:54,435 INFO L426 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1231299601, now seen corresponding path program 634 times [2020-01-16 18:36:54,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:54,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972856350] [2020-01-16 18:36:54,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:54,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-01-16 18:36:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972856350] [2020-01-16 18:36:54,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:54,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783691096] [2020-01-16 18:36:54,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:54,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:54,825 INFO L87 Difference]: Start difference. First operand 800 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:36:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:54,935 INFO L93 Difference]: Finished difference Result 1460 states and 5045 transitions. [2020-01-16 18:36:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:54,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:54,939 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:36:54,939 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:36:54,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:36:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 793. [2020-01-16 18:36:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:36:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-01-16 18:36:54,960 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-01-16 18:36:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:54,960 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-01-16 18:36:54,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-01-16 18:36:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:54,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:54,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:54,961 INFO L426 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:54,962 INFO L82 PathProgramCache]: Analyzing trace with hash 925374263, now seen corresponding path program 635 times [2020-01-16 18:36:54,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:54,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096992501] [2020-01-16 18:36:54,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:55,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096992501] [2020-01-16 18:36:55,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:55,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:55,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794081206] [2020-01-16 18:36:55,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:55,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:55,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:55,351 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:36:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:55,504 INFO L93 Difference]: Finished difference Result 1448 states and 5021 transitions. [2020-01-16 18:36:55,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:55,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:55,507 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:36:55,507 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:36:55,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:36:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-01-16 18:36:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:36:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3150 transitions. [2020-01-16 18:36:55,529 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3150 transitions. Word has length 25 [2020-01-16 18:36:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:55,529 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3150 transitions. [2020-01-16 18:36:55,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3150 transitions. [2020-01-16 18:36:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:55,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:55,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:55,530 INFO L426 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1463229841, now seen corresponding path program 636 times [2020-01-16 18:36:55,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:55,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293432540] [2020-01-16 18:36:55,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:55,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293432540] [2020-01-16 18:36:55,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:55,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:55,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393668324] [2020-01-16 18:36:55,923 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:55,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:55,924 INFO L87 Difference]: Start difference. First operand 797 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:36:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:56,033 INFO L93 Difference]: Finished difference Result 1454 states and 5029 transitions. [2020-01-16 18:36:56,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:56,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:56,037 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:36:56,037 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:36:56,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:36:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 789. [2020-01-16 18:36:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-01-16 18:36:56,057 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-01-16 18:36:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:56,058 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-01-16 18:36:56,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-01-16 18:36:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:56,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:56,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:56,059 INFO L426 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1746813649, now seen corresponding path program 637 times [2020-01-16 18:36:56,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524074349] [2020-01-16 18:36:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:56,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524074349] [2020-01-16 18:36:56,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:56,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:56,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219454057] [2020-01-16 18:36:56,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:56,450 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:36:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:56,615 INFO L93 Difference]: Finished difference Result 1471 states and 5085 transitions. [2020-01-16 18:36:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:56,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:56,619 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:36:56,619 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:36:56,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:36:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 804. [2020-01-16 18:36:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:36:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3172 transitions. [2020-01-16 18:36:56,641 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3172 transitions. Word has length 25 [2020-01-16 18:36:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:56,641 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3172 transitions. [2020-01-16 18:36:56,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3172 transitions. [2020-01-16 18:36:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:56,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:56,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:56,642 INFO L426 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 673728269, now seen corresponding path program 638 times [2020-01-16 18:36:56,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:56,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533657175] [2020-01-16 18:36:56,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:57,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533657175] [2020-01-16 18:36:57,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:57,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:57,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202192996] [2020-01-16 18:36:57,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:57,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:57,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:57,036 INFO L87 Difference]: Start difference. First operand 804 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:36:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:57,178 INFO L93 Difference]: Finished difference Result 1472 states and 5081 transitions. [2020-01-16 18:36:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:57,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:57,181 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:36:57,181 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:36:57,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:36:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-01-16 18:36:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3155 transitions. [2020-01-16 18:36:57,203 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3155 transitions. Word has length 25 [2020-01-16 18:36:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:57,203 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3155 transitions. [2020-01-16 18:36:57,203 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3155 transitions. [2020-01-16 18:36:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:57,204 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:57,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:57,204 INFO L426 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1454062059, now seen corresponding path program 639 times [2020-01-16 18:36:57,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:57,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92586160] [2020-01-16 18:36:57,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:57,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92586160] [2020-01-16 18:36:57,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:57,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:57,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573762640] [2020-01-16 18:36:57,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:57,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:57,591 INFO L87 Difference]: Start difference. First operand 798 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:36:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:57,720 INFO L93 Difference]: Finished difference Result 1474 states and 5084 transitions. [2020-01-16 18:36:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:57,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:57,724 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:36:57,724 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:36:57,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:36:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 805. [2020-01-16 18:36:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:36:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3168 transitions. [2020-01-16 18:36:57,745 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3168 transitions. Word has length 25 [2020-01-16 18:36:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:57,745 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3168 transitions. [2020-01-16 18:36:57,745 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3168 transitions. [2020-01-16 18:36:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:57,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:57,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:57,746 INFO L426 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 694734477, now seen corresponding path program 640 times [2020-01-16 18:36:57,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:57,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874913826] [2020-01-16 18:36:57,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874913826] [2020-01-16 18:36:58,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:58,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:58,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837127509] [2020-01-16 18:36:58,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:58,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:58,145 INFO L87 Difference]: Start difference. First operand 805 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:36:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:58,263 INFO L93 Difference]: Finished difference Result 1477 states and 5083 transitions. [2020-01-16 18:36:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:58,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:58,267 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:36:58,267 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:36:58,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:36:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 798. [2020-01-16 18:36:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:36:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3148 transitions. [2020-01-16 18:36:58,288 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3148 transitions. Word has length 25 [2020-01-16 18:36:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:58,288 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3148 transitions. [2020-01-16 18:36:58,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3148 transitions. [2020-01-16 18:36:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:58,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:58,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] [2020-01-16 18:36:58,289 INFO L426 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1433055851, now seen corresponding path program 641 times [2020-01-16 18:36:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:58,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34093558] [2020-01-16 18:36:58,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:58,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34093558] [2020-01-16 18:36:58,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:58,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:58,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469703272] [2020-01-16 18:36:58,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:58,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:58,683 INFO L87 Difference]: Start difference. First operand 798 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:36:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:58,834 INFO L93 Difference]: Finished difference Result 1478 states and 5085 transitions. [2020-01-16 18:36:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:58,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:58,838 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:36:58,838 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:36:58,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:36:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 807. [2020-01-16 18:36:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:36:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3164 transitions. [2020-01-16 18:36:58,860 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3164 transitions. Word has length 25 [2020-01-16 18:36:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:58,860 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3164 transitions. [2020-01-16 18:36:58,860 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3164 transitions. [2020-01-16 18:36:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:58,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:58,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:58,861 INFO L426 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1788826065, now seen corresponding path program 642 times [2020-01-16 18:36:58,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:58,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460404722] [2020-01-16 18:36:58,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:59,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460404722] [2020-01-16 18:36:59,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:59,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:59,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732380686] [2020-01-16 18:36:59,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:59,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:59,265 INFO L87 Difference]: Start difference. First operand 807 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:36:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:59,395 INFO L93 Difference]: Finished difference Result 1480 states and 5081 transitions. [2020-01-16 18:36:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:59,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:59,399 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:36:59,399 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:36:59,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:36:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 789. [2020-01-16 18:36:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:36:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3126 transitions. [2020-01-16 18:36:59,420 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3126 transitions. Word has length 25 [2020-01-16 18:36:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:36:59,420 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3126 transitions. [2020-01-16 18:36:59,420 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:36:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3126 transitions. [2020-01-16 18:36:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:36:59,421 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:36:59,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:36:59,421 INFO L426 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:36:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:36:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash -611616465, now seen corresponding path program 643 times [2020-01-16 18:36:59,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:36:59,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130559932] [2020-01-16 18:36:59,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:36:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:36:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:36:59,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130559932] [2020-01-16 18:36:59,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:36:59,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:36:59,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247167408] [2020-01-16 18:36:59,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:36:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:36:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:36:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:36:59,806 INFO L87 Difference]: Start difference. First operand 789 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:36:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:36:59,955 INFO L93 Difference]: Finished difference Result 1449 states and 5021 transitions. [2020-01-16 18:36:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:36:59,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:36:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:36:59,958 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:36:59,958 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:36:59,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:36:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:36:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-01-16 18:36:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:37:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3147 transitions. [2020-01-16 18:37:00,000 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3147 transitions. Word has length 25 [2020-01-16 18:37:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:00,000 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3147 transitions. [2020-01-16 18:37:00,000 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3147 transitions. [2020-01-16 18:37:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:00,001 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:00,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:00,001 INFO L426 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash 999324493, now seen corresponding path program 644 times [2020-01-16 18:37:00,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:00,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102410664] [2020-01-16 18:37:00,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:00,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-01-16 18:37:00,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102410664] [2020-01-16 18:37:00,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:00,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:00,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190336524] [2020-01-16 18:37:00,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:00,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:00,389 INFO L87 Difference]: Start difference. First operand 797 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:37:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:00,524 INFO L93 Difference]: Finished difference Result 1453 states and 5026 transitions. [2020-01-16 18:37:00,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:00,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:00,528 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:37:00,528 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:37:00,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:37:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 794. [2020-01-16 18:37:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3139 transitions. [2020-01-16 18:37:00,549 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3139 transitions. Word has length 25 [2020-01-16 18:37:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:00,549 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3139 transitions. [2020-01-16 18:37:00,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3139 transitions. [2020-01-16 18:37:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:00,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:00,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:00,550 INFO L426 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash 482475123, now seen corresponding path program 645 times [2020-01-16 18:37:00,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:00,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770632545] [2020-01-16 18:37:00,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:00,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-01-16 18:37:00,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770632545] [2020-01-16 18:37:00,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:00,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:00,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025715491] [2020-01-16 18:37:00,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:00,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:00,923 INFO L87 Difference]: Start difference. First operand 794 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:37:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:01,051 INFO L93 Difference]: Finished difference Result 1452 states and 5023 transitions. [2020-01-16 18:37:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:01,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:01,055 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:37:01,055 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:37:01,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:37:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 798. [2020-01-16 18:37:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-01-16 18:37:01,076 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-01-16 18:37:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:01,077 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-01-16 18:37:01,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-01-16 18:37:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:01,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:01,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:01,078 INFO L426 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:01,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1020330701, now seen corresponding path program 646 times [2020-01-16 18:37:01,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:01,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359348802] [2020-01-16 18:37:01,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:01,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-01-16 18:37:01,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359348802] [2020-01-16 18:37:01,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:01,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:01,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660379028] [2020-01-16 18:37:01,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:01,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:01,467 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:37:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:01,595 INFO L93 Difference]: Finished difference Result 1458 states and 5031 transitions. [2020-01-16 18:37:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:01,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:01,598 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:37:01,599 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:37:01,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:37:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 794. [2020-01-16 18:37:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3135 transitions. [2020-01-16 18:37:01,620 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3135 transitions. Word has length 25 [2020-01-16 18:37:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:01,620 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3135 transitions. [2020-01-16 18:37:01,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3135 transitions. [2020-01-16 18:37:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:01,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:01,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:01,621 INFO L426 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:01,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:01,621 INFO L82 PathProgramCache]: Analyzing trace with hash 492978227, now seen corresponding path program 647 times [2020-01-16 18:37:01,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:01,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665663193] [2020-01-16 18:37:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:02,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665663193] [2020-01-16 18:37:02,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:02,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:02,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64305531] [2020-01-16 18:37:02,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:02,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:02,010 INFO L87 Difference]: Start difference. First operand 794 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:37:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:02,156 INFO L93 Difference]: Finished difference Result 1465 states and 5048 transitions. [2020-01-16 18:37:02,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:02,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:02,159 INFO L225 Difference]: With dead ends: 1465 [2020-01-16 18:37:02,159 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:37:02,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:37:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 803. [2020-01-16 18:37:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:37:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3151 transitions. [2020-01-16 18:37:02,180 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3151 transitions. Word has length 25 [2020-01-16 18:37:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:02,180 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3151 transitions. [2020-01-16 18:37:02,181 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3151 transitions. [2020-01-16 18:37:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:02,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:02,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:02,182 INFO L426 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash -580107153, now seen corresponding path program 648 times [2020-01-16 18:37:02,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:02,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938799055] [2020-01-16 18:37:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:02,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938799055] [2020-01-16 18:37:02,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:02,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:02,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769922886] [2020-01-16 18:37:02,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:02,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:02,580 INFO L87 Difference]: Start difference. First operand 803 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:37:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:02,683 INFO L93 Difference]: Finished difference Result 1467 states and 5044 transitions. [2020-01-16 18:37:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:02,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:02,687 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:37:02,687 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:37:02,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:37:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 783. [2020-01-16 18:37:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-01-16 18:37:02,707 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-01-16 18:37:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:02,707 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-01-16 18:37:02,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-01-16 18:37:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:02,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:02,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:02,709 INFO L426 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -927302379, now seen corresponding path program 649 times [2020-01-16 18:37:02,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:02,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040580177] [2020-01-16 18:37:02,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:03,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040580177] [2020-01-16 18:37:03,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:03,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:03,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103403529] [2020-01-16 18:37:03,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:03,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:03,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:03,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:03,088 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:37:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:03,265 INFO L93 Difference]: Finished difference Result 1427 states and 4979 transitions. [2020-01-16 18:37:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:03,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:03,269 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:37:03,269 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:37:03,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:37:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 793. [2020-01-16 18:37:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3144 transitions. [2020-01-16 18:37:03,290 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3144 transitions. Word has length 25 [2020-01-16 18:37:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:03,291 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3144 transitions. [2020-01-16 18:37:03,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3144 transitions. [2020-01-16 18:37:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:03,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:03,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:03,292 INFO L426 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 683638579, now seen corresponding path program 650 times [2020-01-16 18:37:03,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:03,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674826394] [2020-01-16 18:37:03,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:03,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674826394] [2020-01-16 18:37:03,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:03,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:03,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318510212] [2020-01-16 18:37:03,691 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:03,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:03,692 INFO L87 Difference]: Start difference. First operand 793 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:37:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:03,870 INFO L93 Difference]: Finished difference Result 1424 states and 4970 transitions. [2020-01-16 18:37:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:03,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:03,873 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:37:03,873 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:37:03,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:37:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-01-16 18:37:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:37:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-01-16 18:37:03,894 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-01-16 18:37:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:03,894 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-01-16 18:37:03,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-01-16 18:37:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:03,895 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:03,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:03,896 INFO L426 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:03,896 INFO L82 PathProgramCache]: Analyzing trace with hash 166789209, now seen corresponding path program 651 times [2020-01-16 18:37:03,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:03,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367684253] [2020-01-16 18:37:03,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:04,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367684253] [2020-01-16 18:37:04,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:04,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:04,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84626183] [2020-01-16 18:37:04,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:04,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:04,265 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:37:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:04,408 INFO L93 Difference]: Finished difference Result 1431 states and 4986 transitions. [2020-01-16 18:37:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:04,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:04,412 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:37:04,412 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:37:04,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:37:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:37:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:37:04,433 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:37:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:04,433 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:37:04,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:37:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:04,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:04,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:04,434 INFO L426 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash 704644787, now seen corresponding path program 652 times [2020-01-16 18:37:04,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:04,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974585119] [2020-01-16 18:37:04,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:04,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974585119] [2020-01-16 18:37:04,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:04,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:04,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760557995] [2020-01-16 18:37:04,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:04,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:04,809 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:37:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:04,988 INFO L93 Difference]: Finished difference Result 1430 states and 4979 transitions. [2020-01-16 18:37:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:04,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:04,991 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:37:04,992 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:37:04,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:37:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 790. [2020-01-16 18:37:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:37:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3133 transitions. [2020-01-16 18:37:05,012 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3133 transitions. Word has length 25 [2020-01-16 18:37:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:05,012 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3133 transitions. [2020-01-16 18:37:05,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3133 transitions. [2020-01-16 18:37:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:05,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:05,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:05,013 INFO L426 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash 177292313, now seen corresponding path program 653 times [2020-01-16 18:37:05,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:05,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881754583] [2020-01-16 18:37:05,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:05,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-01-16 18:37:05,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881754583] [2020-01-16 18:37:05,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:05,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:05,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187270776] [2020-01-16 18:37:05,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:05,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:05,388 INFO L87 Difference]: Start difference. First operand 790 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:37:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:05,562 INFO L93 Difference]: Finished difference Result 1423 states and 4965 transitions. [2020-01-16 18:37:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:05,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:05,566 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:37:05,566 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:37:05,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:37:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 793. [2020-01-16 18:37:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-01-16 18:37:05,588 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-01-16 18:37:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:05,588 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-01-16 18:37:05,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-01-16 18:37:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:05,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:05,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:05,589 INFO L426 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash -895793067, now seen corresponding path program 654 times [2020-01-16 18:37:05,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:05,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34009765] [2020-01-16 18:37:05,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:05,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34009765] [2020-01-16 18:37:05,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:05,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:05,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137121732] [2020-01-16 18:37:05,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:05,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:05,961 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:37:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:06,119 INFO L93 Difference]: Finished difference Result 1425 states and 4966 transitions. [2020-01-16 18:37:06,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:06,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:06,123 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:37:06,123 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:37:06,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:37:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 787. [2020-01-16 18:37:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:37:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3125 transitions. [2020-01-16 18:37:06,144 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3125 transitions. Word has length 25 [2020-01-16 18:37:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:06,144 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3125 transitions. [2020-01-16 18:37:06,144 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3125 transitions. [2020-01-16 18:37:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:06,145 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:06,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] [2020-01-16 18:37:06,145 INFO L426 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:06,146 INFO L82 PathProgramCache]: Analyzing trace with hash 998731699, now seen corresponding path program 655 times [2020-01-16 18:37:06,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:06,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379210624] [2020-01-16 18:37:06,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:06,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379210624] [2020-01-16 18:37:06,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:06,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:06,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050887190] [2020-01-16 18:37:06,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:06,526 INFO L87 Difference]: Start difference. First operand 787 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:37:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:06,702 INFO L93 Difference]: Finished difference Result 1435 states and 4993 transitions. [2020-01-16 18:37:06,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:06,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:06,706 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:37:06,706 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:37:06,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:37:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-01-16 18:37:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3144 transitions. [2020-01-16 18:37:06,727 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3144 transitions. Word has length 25 [2020-01-16 18:37:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:06,727 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3144 transitions. [2020-01-16 18:37:06,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3144 transitions. [2020-01-16 18:37:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:06,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:06,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:06,728 INFO L426 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294639, now seen corresponding path program 656 times [2020-01-16 18:37:06,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:06,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999862546] [2020-01-16 18:37:06,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:07,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999862546] [2020-01-16 18:37:07,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:07,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:07,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367924940] [2020-01-16 18:37:07,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:07,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:07,106 INFO L87 Difference]: Start difference. First operand 794 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:37:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:07,247 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-01-16 18:37:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:07,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:07,251 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:37:07,251 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:37:07,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:37:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-01-16 18:37:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-01-16 18:37:07,293 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-01-16 18:37:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:07,293 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-01-16 18:37:07,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-01-16 18:37:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:07,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:07,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:07,295 INFO L426 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash 492385433, now seen corresponding path program 657 times [2020-01-16 18:37:07,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:07,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69954968] [2020-01-16 18:37:07,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69954968] [2020-01-16 18:37:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:07,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:07,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042949487] [2020-01-16 18:37:07,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:07,665 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:37:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:07,825 INFO L93 Difference]: Finished difference Result 1445 states and 5012 transitions. [2020-01-16 18:37:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:07,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:07,829 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:37:07,829 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:37:07,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:37:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-01-16 18:37:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3149 transitions. [2020-01-16 18:37:07,850 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3149 transitions. Word has length 25 [2020-01-16 18:37:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:07,851 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3149 transitions. [2020-01-16 18:37:07,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3149 transitions. [2020-01-16 18:37:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:07,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:07,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:07,852 INFO L426 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1653785327, now seen corresponding path program 658 times [2020-01-16 18:37:07,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:07,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775382311] [2020-01-16 18:37:07,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:08,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775382311] [2020-01-16 18:37:08,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:08,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:08,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419357396] [2020-01-16 18:37:08,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:08,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:08,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:08,237 INFO L87 Difference]: Start difference. First operand 798 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:37:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:08,356 INFO L93 Difference]: Finished difference Result 1448 states and 5011 transitions. [2020-01-16 18:37:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:08,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:08,359 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:37:08,360 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:37:08,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:37:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 791. [2020-01-16 18:37:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3132 transitions. [2020-01-16 18:37:08,380 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3132 transitions. Word has length 25 [2020-01-16 18:37:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:08,380 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3132 transitions. [2020-01-16 18:37:08,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3132 transitions. [2020-01-16 18:37:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:08,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:08,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:08,381 INFO L426 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:08,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash 502888537, now seen corresponding path program 659 times [2020-01-16 18:37:08,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:08,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231603145] [2020-01-16 18:37:08,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:08,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231603145] [2020-01-16 18:37:08,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:08,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:08,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241789176] [2020-01-16 18:37:08,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:08,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:08,757 INFO L87 Difference]: Start difference. First operand 791 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:37:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:08,900 INFO L93 Difference]: Finished difference Result 1436 states and 4987 transitions. [2020-01-16 18:37:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:08,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:08,903 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:37:08,903 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:37:08,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:37:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 795. [2020-01-16 18:37:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3139 transitions. [2020-01-16 18:37:08,924 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3139 transitions. Word has length 25 [2020-01-16 18:37:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:08,924 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3139 transitions. [2020-01-16 18:37:08,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3139 transitions. [2020-01-16 18:37:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:08,925 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:08,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:08,926 INFO L426 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1040744115, now seen corresponding path program 660 times [2020-01-16 18:37:08,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:08,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282732533] [2020-01-16 18:37:08,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:09,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282732533] [2020-01-16 18:37:09,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:09,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:09,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391434816] [2020-01-16 18:37:09,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:09,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:09,308 INFO L87 Difference]: Start difference. First operand 795 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:37:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:09,421 INFO L93 Difference]: Finished difference Result 1442 states and 4995 transitions. [2020-01-16 18:37:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:09,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:09,425 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:37:09,425 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:37:09,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:37:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 787. [2020-01-16 18:37:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:37:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3121 transitions. [2020-01-16 18:37:09,446 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3121 transitions. Word has length 25 [2020-01-16 18:37:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:09,446 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3121 transitions. [2020-01-16 18:37:09,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3121 transitions. [2020-01-16 18:37:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:09,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:09,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:09,447 INFO L426 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1649924147, now seen corresponding path program 661 times [2020-01-16 18:37:09,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:09,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103878834] [2020-01-16 18:37:09,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:09,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103878834] [2020-01-16 18:37:09,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:09,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:09,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847677701] [2020-01-16 18:37:09,831 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:09,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:09,832 INFO L87 Difference]: Start difference. First operand 787 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:37:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:10,007 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-01-16 18:37:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:10,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:10,010 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:37:10,010 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:37:10,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:37:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-01-16 18:37:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3152 transitions. [2020-01-16 18:37:10,031 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3152 transitions. Word has length 25 [2020-01-16 18:37:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:10,031 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3152 transitions. [2020-01-16 18:37:10,031 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3152 transitions. [2020-01-16 18:37:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:10,032 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:10,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:10,033 INFO L426 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:10,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2107187571, now seen corresponding path program 662 times [2020-01-16 18:37:10,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:10,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590090922] [2020-01-16 18:37:10,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:10,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590090922] [2020-01-16 18:37:10,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:10,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:10,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444007864] [2020-01-16 18:37:10,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:10,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:10,412 INFO L87 Difference]: Start difference. First operand 798 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:37:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:10,569 INFO L93 Difference]: Finished difference Result 1446 states and 5016 transitions. [2020-01-16 18:37:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:10,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:10,573 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:37:10,573 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:37:10,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:37:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-01-16 18:37:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-01-16 18:37:10,595 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-01-16 18:37:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:10,595 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-01-16 18:37:10,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-01-16 18:37:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:10,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:10,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:10,596 INFO L426 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 49486293, now seen corresponding path program 663 times [2020-01-16 18:37:10,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:10,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040582452] [2020-01-16 18:37:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:11,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040582452] [2020-01-16 18:37:11,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:11,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:11,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797218143] [2020-01-16 18:37:11,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:11,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:11,006 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:37:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:11,181 INFO L93 Difference]: Finished difference Result 1453 states and 5030 transitions. [2020-01-16 18:37:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:11,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:11,185 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:37:11,185 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:37:11,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:37:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 800. [2020-01-16 18:37:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:37:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3151 transitions. [2020-01-16 18:37:11,207 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3151 transitions. Word has length 25 [2020-01-16 18:37:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:11,207 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3151 transitions. [2020-01-16 18:37:11,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3151 transitions. [2020-01-16 18:37:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:11,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:11,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:11,209 INFO L426 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2096684467, now seen corresponding path program 664 times [2020-01-16 18:37:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:11,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428912516] [2020-01-16 18:37:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:11,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428912516] [2020-01-16 18:37:11,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:11,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:11,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738246825] [2020-01-16 18:37:11,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:11,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:11,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:11,596 INFO L87 Difference]: Start difference. First operand 800 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:37:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:11,711 INFO L93 Difference]: Finished difference Result 1456 states and 5029 transitions. [2020-01-16 18:37:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:11,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:11,714 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:37:11,714 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:37:11,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:37:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 793. [2020-01-16 18:37:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3132 transitions. [2020-01-16 18:37:11,735 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3132 transitions. Word has length 25 [2020-01-16 18:37:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:11,735 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3132 transitions. [2020-01-16 18:37:11,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3132 transitions. [2020-01-16 18:37:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:11,736 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:11,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:11,736 INFO L426 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 80995605, now seen corresponding path program 665 times [2020-01-16 18:37:11,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:11,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420274969] [2020-01-16 18:37:11,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:12,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420274969] [2020-01-16 18:37:12,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:12,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:12,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085322535] [2020-01-16 18:37:12,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:12,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:12,118 INFO L87 Difference]: Start difference. First operand 793 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:37:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:12,272 INFO L93 Difference]: Finished difference Result 1450 states and 5017 transitions. [2020-01-16 18:37:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:12,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:12,275 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:37:12,276 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:37:12,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:37:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-01-16 18:37:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:37:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3143 transitions. [2020-01-16 18:37:12,296 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3143 transitions. Word has length 25 [2020-01-16 18:37:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:12,296 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3143 transitions. [2020-01-16 18:37:12,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3143 transitions. [2020-01-16 18:37:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:12,298 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:12,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:12,298 INFO L426 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1691936563, now seen corresponding path program 666 times [2020-01-16 18:37:12,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:12,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996155481] [2020-01-16 18:37:12,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:12,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996155481] [2020-01-16 18:37:12,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:12,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:12,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148999412] [2020-01-16 18:37:12,684 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:12,684 INFO L87 Difference]: Start difference. First operand 799 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:37:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:12,805 INFO L93 Difference]: Finished difference Result 1454 states and 5019 transitions. [2020-01-16 18:37:12,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:12,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:12,809 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:37:12,809 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:37:12,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:37:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 787. [2020-01-16 18:37:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:37:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3117 transitions. [2020-01-16 18:37:12,830 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3117 transitions. Word has length 25 [2020-01-16 18:37:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:12,830 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3117 transitions. [2020-01-16 18:37:12,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3117 transitions. [2020-01-16 18:37:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:12,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:12,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:12,831 INFO L426 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -708505967, now seen corresponding path program 667 times [2020-01-16 18:37:12,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701051764] [2020-01-16 18:37:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:13,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-01-16 18:37:13,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701051764] [2020-01-16 18:37:13,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:13,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:13,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177019308] [2020-01-16 18:37:13,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:13,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:13,203 INFO L87 Difference]: Start difference. First operand 787 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:37:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:13,345 INFO L93 Difference]: Finished difference Result 1429 states and 4972 transitions. [2020-01-16 18:37:13,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:13,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:13,349 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:37:13,349 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:37:13,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:37:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-01-16 18:37:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-01-16 18:37:13,370 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-01-16 18:37:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:13,370 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-01-16 18:37:13,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-01-16 18:37:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:13,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:13,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:13,371 INFO L426 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1781591347, now seen corresponding path program 668 times [2020-01-16 18:37:13,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:13,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621472343] [2020-01-16 18:37:13,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:13,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621472343] [2020-01-16 18:37:13,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:13,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:13,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975478747] [2020-01-16 18:37:13,742 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:13,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:13,742 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:37:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:13,913 INFO L93 Difference]: Finished difference Result 1431 states and 4973 transitions. [2020-01-16 18:37:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:13,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:13,916 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:37:13,917 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:37:13,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:37:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-01-16 18:37:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-01-16 18:37:13,939 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-01-16 18:37:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:13,939 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-01-16 18:37:13,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-01-16 18:37:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:13,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:13,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:13,940 INFO L426 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1986023475, now seen corresponding path program 669 times [2020-01-16 18:37:13,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:13,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360503490] [2020-01-16 18:37:13,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:14,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360503490] [2020-01-16 18:37:14,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:14,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:14,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989816936] [2020-01-16 18:37:14,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:14,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:14,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:14,307 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:37:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:14,479 INFO L93 Difference]: Finished difference Result 1434 states and 4978 transitions. [2020-01-16 18:37:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:14,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:14,483 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:37:14,483 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:37:14,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:37:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-01-16 18:37:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3135 transitions. [2020-01-16 18:37:14,505 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3135 transitions. Word has length 25 [2020-01-16 18:37:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:14,505 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3135 transitions. [2020-01-16 18:37:14,505 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3135 transitions. [2020-01-16 18:37:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:14,506 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:14,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:14,506 INFO L426 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1771088243, now seen corresponding path program 670 times [2020-01-16 18:37:14,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:14,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878054937] [2020-01-16 18:37:14,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:14,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878054937] [2020-01-16 18:37:14,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:14,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779364455] [2020-01-16 18:37:14,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:14,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:14,898 INFO L87 Difference]: Start difference. First operand 795 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:37:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:14,994 INFO L93 Difference]: Finished difference Result 1440 states and 4986 transitions. [2020-01-16 18:37:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:14,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:14,997 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:37:14,998 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:37:14,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:37:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-01-16 18:37:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3124 transitions. [2020-01-16 18:37:15,019 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3124 transitions. Word has length 25 [2020-01-16 18:37:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:15,019 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3124 transitions. [2020-01-16 18:37:15,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3124 transitions. [2020-01-16 18:37:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:15,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:15,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:15,021 INFO L426 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2007029683, now seen corresponding path program 671 times [2020-01-16 18:37:15,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:15,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296414203] [2020-01-16 18:37:15,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:15,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296414203] [2020-01-16 18:37:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:15,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125244358] [2020-01-16 18:37:15,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:15,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:15,401 INFO L87 Difference]: Start difference. First operand 791 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:37:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:15,541 INFO L93 Difference]: Finished difference Result 1440 states and 4988 transitions. [2020-01-16 18:37:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:15,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:15,545 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:37:15,545 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:37:15,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:37:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 797. [2020-01-16 18:37:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:37:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3135 transitions. [2020-01-16 18:37:15,566 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3135 transitions. Word has length 25 [2020-01-16 18:37:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:15,566 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3135 transitions. [2020-01-16 18:37:15,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3135 transitions. [2020-01-16 18:37:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:15,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:15,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:15,567 INFO L426 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -676996655, now seen corresponding path program 672 times [2020-01-16 18:37:15,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:15,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99288980] [2020-01-16 18:37:15,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:15,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-01-16 18:37:15,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99288980] [2020-01-16 18:37:15,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:15,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:15,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154537331] [2020-01-16 18:37:15,940 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:15,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:15,940 INFO L87 Difference]: Start difference. First operand 797 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:37:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:16,039 INFO L93 Difference]: Finished difference Result 1444 states and 4990 transitions. [2020-01-16 18:37:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:16,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:16,042 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:37:16,042 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:37:16,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:37:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 783. [2020-01-16 18:37:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3106 transitions. [2020-01-16 18:37:16,063 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3106 transitions. Word has length 25 [2020-01-16 18:37:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:16,064 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3106 transitions. [2020-01-16 18:37:16,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3106 transitions. [2020-01-16 18:37:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:16,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:16,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:16,065 INFO L426 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1024191881, now seen corresponding path program 673 times [2020-01-16 18:37:16,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:16,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088268374] [2020-01-16 18:37:16,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:16,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088268374] [2020-01-16 18:37:16,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:16,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:16,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125061218] [2020-01-16 18:37:16,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:16,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:16,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:16,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:16,453 INFO L87 Difference]: Start difference. First operand 783 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:37:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:16,577 INFO L93 Difference]: Finished difference Result 1474 states and 5108 transitions. [2020-01-16 18:37:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:16,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:16,580 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:37:16,580 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:37:16,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:37:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 803. [2020-01-16 18:37:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:37:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3170 transitions. [2020-01-16 18:37:16,602 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3170 transitions. Word has length 25 [2020-01-16 18:37:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:16,602 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3170 transitions. [2020-01-16 18:37:16,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3170 transitions. [2020-01-16 18:37:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:16,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:16,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:16,603 INFO L426 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2097277261, now seen corresponding path program 674 times [2020-01-16 18:37:16,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:16,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148497893] [2020-01-16 18:37:16,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:16,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148497893] [2020-01-16 18:37:16,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:16,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:16,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844828064] [2020-01-16 18:37:16,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:16,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:16,994 INFO L87 Difference]: Start difference. First operand 803 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:37:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:17,116 INFO L93 Difference]: Finished difference Result 1475 states and 5104 transitions. [2020-01-16 18:37:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:17,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:17,119 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:37:17,119 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:37:17,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:37:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 797. [2020-01-16 18:37:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:37:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-01-16 18:37:17,141 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-01-16 18:37:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:17,141 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-01-16 18:37:17,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-01-16 18:37:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:17,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:17,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:17,142 INFO L426 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1670337561, now seen corresponding path program 675 times [2020-01-16 18:37:17,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:17,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022902937] [2020-01-16 18:37:17,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:17,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022902937] [2020-01-16 18:37:17,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:17,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:17,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428193367] [2020-01-16 18:37:17,529 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:17,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:17,529 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:37:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:17,660 INFO L93 Difference]: Finished difference Result 1471 states and 5096 transitions. [2020-01-16 18:37:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:17,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:17,664 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:37:17,664 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:37:17,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:37:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 802. [2020-01-16 18:37:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:37:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3163 transitions. [2020-01-16 18:37:17,686 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3163 transitions. Word has length 25 [2020-01-16 18:37:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:17,686 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3163 transitions. [2020-01-16 18:37:17,686 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3163 transitions. [2020-01-16 18:37:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:17,687 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:17,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:17,687 INFO L426 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2086774157, now seen corresponding path program 676 times [2020-01-16 18:37:17,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:17,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547472958] [2020-01-16 18:37:17,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547472958] [2020-01-16 18:37:18,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:18,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:18,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788623985] [2020-01-16 18:37:18,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:18,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:18,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:18,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:18,078 INFO L87 Difference]: Start difference. First operand 802 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:37:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:18,217 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-01-16 18:37:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:18,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:18,221 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:37:18,221 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:37:18,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:37:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 797. [2020-01-16 18:37:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:37:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3149 transitions. [2020-01-16 18:37:18,244 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3149 transitions. Word has length 25 [2020-01-16 18:37:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:18,244 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3149 transitions. [2020-01-16 18:37:18,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3149 transitions. [2020-01-16 18:37:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:18,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:18,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:18,245 INFO L426 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1691343769, now seen corresponding path program 677 times [2020-01-16 18:37:18,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:18,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58243130] [2020-01-16 18:37:18,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:18,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-01-16 18:37:18,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58243130] [2020-01-16 18:37:18,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:18,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:18,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427104395] [2020-01-16 18:37:18,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:18,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:18,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:18,650 INFO L87 Difference]: Start difference. First operand 797 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:37:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:18,770 INFO L93 Difference]: Finished difference Result 1473 states and 5095 transitions. [2020-01-16 18:37:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:18,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:18,774 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:37:18,774 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:37:18,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:37:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 802. [2020-01-16 18:37:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:37:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3158 transitions. [2020-01-16 18:37:18,796 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3158 transitions. Word has length 25 [2020-01-16 18:37:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:18,796 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3158 transitions. [2020-01-16 18:37:18,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3158 transitions. [2020-01-16 18:37:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:18,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:18,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:18,797 INFO L426 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -992682569, now seen corresponding path program 678 times [2020-01-16 18:37:18,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:18,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741613177] [2020-01-16 18:37:18,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:19,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741613177] [2020-01-16 18:37:19,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:19,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:19,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097985907] [2020-01-16 18:37:19,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:19,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:19,189 INFO L87 Difference]: Start difference. First operand 802 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:37:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:19,311 INFO L93 Difference]: Finished difference Result 1471 states and 5086 transitions. [2020-01-16 18:37:19,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:19,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:19,315 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:37:19,315 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:37:19,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:37:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 792. [2020-01-16 18:37:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:37:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3135 transitions. [2020-01-16 18:37:19,336 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3135 transitions. Word has length 25 [2020-01-16 18:37:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:19,336 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3135 transitions. [2020-01-16 18:37:19,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3135 transitions. [2020-01-16 18:37:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:19,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:19,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:19,337 INFO L426 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash 901842197, now seen corresponding path program 679 times [2020-01-16 18:37:19,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:19,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110531757] [2020-01-16 18:37:19,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:19,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110531757] [2020-01-16 18:37:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055380255] [2020-01-16 18:37:19,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:19,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:19,732 INFO L87 Difference]: Start difference. First operand 792 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:37:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:19,874 INFO L93 Difference]: Finished difference Result 1488 states and 5134 transitions. [2020-01-16 18:37:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:19,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:19,878 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:37:19,878 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:37:19,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:37:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 807. [2020-01-16 18:37:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:37:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3175 transitions. [2020-01-16 18:37:19,899 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3175 transitions. Word has length 25 [2020-01-16 18:37:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:19,899 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3175 transitions. [2020-01-16 18:37:19,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3175 transitions. [2020-01-16 18:37:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:19,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:19,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:19,900 INFO L426 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -171243183, now seen corresponding path program 680 times [2020-01-16 18:37:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:19,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204821553] [2020-01-16 18:37:19,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:20,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-01-16 18:37:20,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204821553] [2020-01-16 18:37:20,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:20,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:20,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795570534] [2020-01-16 18:37:20,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:20,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:20,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:20,297 INFO L87 Difference]: Start difference. First operand 807 states and 3175 transitions. Second operand 10 states. [2020-01-16 18:37:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:20,421 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-01-16 18:37:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:20,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:20,424 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:37:20,425 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:37:20,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:37:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 801. [2020-01-16 18:37:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:37:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3158 transitions. [2020-01-16 18:37:20,446 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3158 transitions. Word has length 25 [2020-01-16 18:37:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:20,446 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3158 transitions. [2020-01-16 18:37:20,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3158 transitions. [2020-01-16 18:37:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:20,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:20,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:20,448 INFO L426 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1995933785, now seen corresponding path program 681 times [2020-01-16 18:37:20,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:20,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338838352] [2020-01-16 18:37:20,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:20,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338838352] [2020-01-16 18:37:20,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:20,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:20,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382182546] [2020-01-16 18:37:20,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:20,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:20,846 INFO L87 Difference]: Start difference. First operand 801 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:37:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:20,968 INFO L93 Difference]: Finished difference Result 1491 states and 5133 transitions. [2020-01-16 18:37:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:20,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:20,972 INFO L225 Difference]: With dead ends: 1491 [2020-01-16 18:37:20,972 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:37:20,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:37:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 808. [2020-01-16 18:37:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:37:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3171 transitions. [2020-01-16 18:37:20,993 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3171 transitions. Word has length 25 [2020-01-16 18:37:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:20,993 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3171 transitions. [2020-01-16 18:37:20,993 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3171 transitions. [2020-01-16 18:37:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:20,994 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:20,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] [2020-01-16 18:37:20,994 INFO L426 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash -150236975, now seen corresponding path program 682 times [2020-01-16 18:37:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:20,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486664995] [2020-01-16 18:37:20,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:21,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-01-16 18:37:21,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486664995] [2020-01-16 18:37:21,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:21,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:21,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539239238] [2020-01-16 18:37:21,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:21,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:21,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:21,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:21,397 INFO L87 Difference]: Start difference. First operand 808 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:37:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:21,496 INFO L93 Difference]: Finished difference Result 1494 states and 5132 transitions. [2020-01-16 18:37:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:21,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:21,500 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:37:21,500 INFO L226 Difference]: Without dead ends: 1469 [2020-01-16 18:37:21,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-01-16 18:37:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 801. [2020-01-16 18:37:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:37:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-01-16 18:37:21,522 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-01-16 18:37:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:21,522 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-01-16 18:37:21,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-01-16 18:37:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:21,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:21,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:21,523 INFO L426 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2016939993, now seen corresponding path program 683 times [2020-01-16 18:37:21,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:21,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101962683] [2020-01-16 18:37:21,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:21,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101962683] [2020-01-16 18:37:21,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:21,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:21,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097815058] [2020-01-16 18:37:21,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:21,945 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:37:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:22,065 INFO L93 Difference]: Finished difference Result 1495 states and 5134 transitions. [2020-01-16 18:37:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:22,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:22,069 INFO L225 Difference]: With dead ends: 1495 [2020-01-16 18:37:22,069 INFO L226 Difference]: Without dead ends: 1479 [2020-01-16 18:37:22,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2020-01-16 18:37:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 810. [2020-01-16 18:37:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:37:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-01-16 18:37:22,090 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-01-16 18:37:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:22,090 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-01-16 18:37:22,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-01-16 18:37:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:22,091 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:22,091 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:22,091 INFO L426 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:22,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 943854613, now seen corresponding path program 684 times [2020-01-16 18:37:22,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:22,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287428036] [2020-01-16 18:37:22,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:22,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287428036] [2020-01-16 18:37:22,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:22,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:22,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390300348] [2020-01-16 18:37:22,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:22,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:22,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:22,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:22,521 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:37:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:22,627 INFO L93 Difference]: Finished difference Result 1497 states and 5130 transitions. [2020-01-16 18:37:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:22,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:22,631 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:37:22,631 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:37:22,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:37:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 792. [2020-01-16 18:37:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:37:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3127 transitions. [2020-01-16 18:37:22,652 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3127 transitions. Word has length 25 [2020-01-16 18:37:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:22,652 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3127 transitions. [2020-01-16 18:37:22,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3127 transitions. [2020-01-16 18:37:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:22,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:22,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:22,653 INFO L426 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1227438421, now seen corresponding path program 685 times [2020-01-16 18:37:22,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:22,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006466676] [2020-01-16 18:37:22,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:23,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006466676] [2020-01-16 18:37:23,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:23,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:23,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851994280] [2020-01-16 18:37:23,041 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:23,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:23,041 INFO L87 Difference]: Start difference. First operand 792 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:37:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:23,168 INFO L93 Difference]: Finished difference Result 1476 states and 5098 transitions. [2020-01-16 18:37:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:23,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:23,172 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:37:23,172 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:37:23,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:37:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 803. [2020-01-16 18:37:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:37:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3158 transitions. [2020-01-16 18:37:23,194 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3158 transitions. Word has length 25 [2020-01-16 18:37:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:23,194 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3158 transitions. [2020-01-16 18:37:23,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3158 transitions. [2020-01-16 18:37:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:23,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:23,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:23,195 INFO L426 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1765293999, now seen corresponding path program 686 times [2020-01-16 18:37:23,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:23,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979949451] [2020-01-16 18:37:23,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:23,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979949451] [2020-01-16 18:37:23,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:23,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:23,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715941276] [2020-01-16 18:37:23,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:23,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:23,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:23,589 INFO L87 Difference]: Start difference. First operand 803 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:37:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:23,716 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-01-16 18:37:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:23,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:23,720 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:37:23,720 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:37:23,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:37:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 798. [2020-01-16 18:37:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-01-16 18:37:23,742 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-01-16 18:37:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:23,742 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-01-16 18:37:23,742 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-01-16 18:37:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:23,743 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:23,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] [2020-01-16 18:37:23,743 INFO L426 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:23,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash -372999433, now seen corresponding path program 687 times [2020-01-16 18:37:23,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:23,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963327230] [2020-01-16 18:37:23,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:24,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963327230] [2020-01-16 18:37:24,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:24,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:24,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642428891] [2020-01-16 18:37:24,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:24,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:24,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:24,140 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:37:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:24,263 INFO L93 Difference]: Finished difference Result 1482 states and 5105 transitions. [2020-01-16 18:37:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:24,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:24,267 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:37:24,267 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:37:24,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:37:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 805. [2020-01-16 18:37:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:37:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3157 transitions. [2020-01-16 18:37:24,288 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3157 transitions. Word has length 25 [2020-01-16 18:37:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:24,288 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3157 transitions. [2020-01-16 18:37:24,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3157 transitions. [2020-01-16 18:37:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:24,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:24,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] [2020-01-16 18:37:24,289 INFO L426 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1775797103, now seen corresponding path program 688 times [2020-01-16 18:37:24,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:24,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096731749] [2020-01-16 18:37:24,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:24,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-01-16 18:37:24,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096731749] [2020-01-16 18:37:24,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:24,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:24,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233509838] [2020-01-16 18:37:24,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:24,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:24,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:24,689 INFO L87 Difference]: Start difference. First operand 805 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:37:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:24,789 INFO L93 Difference]: Finished difference Result 1485 states and 5104 transitions. [2020-01-16 18:37:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:24,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:24,793 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:37:24,793 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:37:24,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:37:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 798. [2020-01-16 18:37:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3138 transitions. [2020-01-16 18:37:24,814 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3138 transitions. Word has length 25 [2020-01-16 18:37:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:24,814 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3138 transitions. [2020-01-16 18:37:24,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3138 transitions. [2020-01-16 18:37:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:24,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:24,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:24,815 INFO L426 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash -341490121, now seen corresponding path program 689 times [2020-01-16 18:37:24,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:24,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347414503] [2020-01-16 18:37:24,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:25,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347414503] [2020-01-16 18:37:25,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:25,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:25,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528707027] [2020-01-16 18:37:25,207 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:25,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:25,207 INFO L87 Difference]: Start difference. First operand 798 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:37:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:25,349 INFO L93 Difference]: Finished difference Result 1479 states and 5092 transitions. [2020-01-16 18:37:25,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:25,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:25,353 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:37:25,353 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:37:25,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:37:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 804. [2020-01-16 18:37:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:37:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3149 transitions. [2020-01-16 18:37:25,374 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3149 transitions. Word has length 25 [2020-01-16 18:37:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:25,375 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3149 transitions. [2020-01-16 18:37:25,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3149 transitions. [2020-01-16 18:37:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:25,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:25,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:25,376 INFO L426 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1269450837, now seen corresponding path program 690 times [2020-01-16 18:37:25,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:25,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414803613] [2020-01-16 18:37:25,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:25,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414803613] [2020-01-16 18:37:25,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:25,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:25,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386079950] [2020-01-16 18:37:25,768 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:25,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:25,769 INFO L87 Difference]: Start difference. First operand 804 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:37:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:25,869 INFO L93 Difference]: Finished difference Result 1483 states and 5094 transitions. [2020-01-16 18:37:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:25,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:25,873 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:37:25,873 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:37:25,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:37:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-01-16 18:37:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:37:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3121 transitions. [2020-01-16 18:37:25,894 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3121 transitions. Word has length 25 [2020-01-16 18:37:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:25,894 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3121 transitions. [2020-01-16 18:37:25,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3121 transitions. [2020-01-16 18:37:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:25,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:25,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:25,896 INFO L426 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash 805545489, now seen corresponding path program 691 times [2020-01-16 18:37:25,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:25,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396634030] [2020-01-16 18:37:25,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:26,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396634030] [2020-01-16 18:37:26,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:26,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:26,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862913214] [2020-01-16 18:37:26,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:26,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:26,285 INFO L87 Difference]: Start difference. First operand 792 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:37:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:26,425 INFO L93 Difference]: Finished difference Result 1482 states and 5104 transitions. [2020-01-16 18:37:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:26,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:26,429 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:37:26,429 INFO L226 Difference]: Without dead ends: 1466 [2020-01-16 18:37:26,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-01-16 18:37:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 804. [2020-01-16 18:37:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:37:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3154 transitions. [2020-01-16 18:37:26,451 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3154 transitions. Word has length 25 [2020-01-16 18:37:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:26,451 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3154 transitions. [2020-01-16 18:37:26,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3154 transitions. [2020-01-16 18:37:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:26,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:26,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:26,452 INFO L426 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1878480849, now seen corresponding path program 692 times [2020-01-16 18:37:26,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:26,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672454696] [2020-01-16 18:37:26,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:26,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-01-16 18:37:26,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672454696] [2020-01-16 18:37:26,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:26,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:26,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470689680] [2020-01-16 18:37:26,834 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:26,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:26,835 INFO L87 Difference]: Start difference. First operand 804 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:37:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:26,963 INFO L93 Difference]: Finished difference Result 1480 states and 5095 transitions. [2020-01-16 18:37:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:26,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:26,966 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:37:26,967 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:37:26,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:37:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 799. [2020-01-16 18:37:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:37:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3140 transitions. [2020-01-16 18:37:26,987 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3140 transitions. Word has length 25 [2020-01-16 18:37:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:26,987 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3140 transitions. [2020-01-16 18:37:26,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3140 transitions. [2020-01-16 18:37:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:26,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:26,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:26,989 INFO L426 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash -794892365, now seen corresponding path program 693 times [2020-01-16 18:37:26,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:26,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545783929] [2020-01-16 18:37:26,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:27,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545783929] [2020-01-16 18:37:27,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:27,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:27,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986809260] [2020-01-16 18:37:27,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:27,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:27,383 INFO L87 Difference]: Start difference. First operand 799 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:37:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:27,530 INFO L93 Difference]: Finished difference Result 1490 states and 5115 transitions. [2020-01-16 18:37:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:27,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:27,534 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:37:27,534 INFO L226 Difference]: Without dead ends: 1474 [2020-01-16 18:37:27,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-01-16 18:37:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 808. [2020-01-16 18:37:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:37:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3156 transitions. [2020-01-16 18:37:27,556 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3156 transitions. Word has length 25 [2020-01-16 18:37:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:27,556 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3156 transitions. [2020-01-16 18:37:27,556 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3156 transitions. [2020-01-16 18:37:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:27,557 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:27,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:27,557 INFO L426 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1867977745, now seen corresponding path program 694 times [2020-01-16 18:37:27,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:27,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209435410] [2020-01-16 18:37:27,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:27,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209435410] [2020-01-16 18:37:27,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:27,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:27,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831123770] [2020-01-16 18:37:27,957 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:27,958 INFO L87 Difference]: Start difference. First operand 808 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:37:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:28,063 INFO L93 Difference]: Finished difference Result 1492 states and 5111 transitions. [2020-01-16 18:37:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:28,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:28,067 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:37:28,067 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:37:28,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:37:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 799. [2020-01-16 18:37:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:37:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3133 transitions. [2020-01-16 18:37:28,088 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3133 transitions. Word has length 25 [2020-01-16 18:37:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:28,088 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3133 transitions. [2020-01-16 18:37:28,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3133 transitions. [2020-01-16 18:37:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:28,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:28,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:28,089 INFO L426 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash -784389261, now seen corresponding path program 695 times [2020-01-16 18:37:28,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:28,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226042045] [2020-01-16 18:37:28,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:28,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226042045] [2020-01-16 18:37:28,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:28,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:28,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454636643] [2020-01-16 18:37:28,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:28,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:28,488 INFO L87 Difference]: Start difference. First operand 799 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:37:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:28,632 INFO L93 Difference]: Finished difference Result 1483 states and 5093 transitions. [2020-01-16 18:37:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:28,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:28,635 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:37:28,635 INFO L226 Difference]: Without dead ends: 1469 [2020-01-16 18:37:28,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-01-16 18:37:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 805. [2020-01-16 18:37:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:37:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3144 transitions. [2020-01-16 18:37:28,657 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3144 transitions. Word has length 25 [2020-01-16 18:37:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:28,657 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3144 transitions. [2020-01-16 18:37:28,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3144 transitions. [2020-01-16 18:37:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:28,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:28,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:28,658 INFO L426 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 826551697, now seen corresponding path program 696 times [2020-01-16 18:37:28,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:28,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466096979] [2020-01-16 18:37:28,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:29,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466096979] [2020-01-16 18:37:29,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:29,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:29,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471853696] [2020-01-16 18:37:29,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:29,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:29,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:29,048 INFO L87 Difference]: Start difference. First operand 805 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:37:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:29,154 INFO L93 Difference]: Finished difference Result 1487 states and 5095 transitions. [2020-01-16 18:37:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:29,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:29,158 INFO L225 Difference]: With dead ends: 1487 [2020-01-16 18:37:29,158 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:37:29,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:37:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 783. [2020-01-16 18:37:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3099 transitions. [2020-01-16 18:37:29,180 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3099 transitions. Word has length 25 [2020-01-16 18:37:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:29,180 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3099 transitions. [2020-01-16 18:37:29,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3099 transitions. [2020-01-16 18:37:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:29,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:29,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:29,181 INFO L426 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 489859575, now seen corresponding path program 697 times [2020-01-16 18:37:29,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:29,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844657630] [2020-01-16 18:37:29,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844657630] [2020-01-16 18:37:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:29,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:29,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767778821] [2020-01-16 18:37:29,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:29,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:29,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:29,541 INFO L87 Difference]: Start difference. First operand 783 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:37:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:29,670 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-01-16 18:37:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:29,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:29,673 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:37:29,673 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:37:29,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:37:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-01-16 18:37:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-01-16 18:37:29,695 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-01-16 18:37:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:29,695 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-01-16 18:37:29,695 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-01-16 18:37:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:29,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:29,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:29,697 INFO L426 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2100800533, now seen corresponding path program 698 times [2020-01-16 18:37:29,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:29,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825922058] [2020-01-16 18:37:29,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825922058] [2020-01-16 18:37:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583351250] [2020-01-16 18:37:30,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:30,059 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:37:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:30,187 INFO L93 Difference]: Finished difference Result 1436 states and 4984 transitions. [2020-01-16 18:37:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:30,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:30,190 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:37:30,190 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:37:30,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:37:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-01-16 18:37:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-01-16 18:37:30,211 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-01-16 18:37:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:30,211 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-01-16 18:37:30,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-01-16 18:37:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:30,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:30,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:30,212 INFO L426 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1110578279, now seen corresponding path program 699 times [2020-01-16 18:37:30,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:30,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936250709] [2020-01-16 18:37:30,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:30,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-01-16 18:37:30,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936250709] [2020-01-16 18:37:30,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:30,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:30,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166703013] [2020-01-16 18:37:30,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:30,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:30,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:30,577 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:37:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:30,713 INFO L93 Difference]: Finished difference Result 1430 states and 4972 transitions. [2020-01-16 18:37:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:30,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:30,716 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:37:30,716 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:37:30,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:37:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-01-16 18:37:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:37:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-01-16 18:37:30,738 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-01-16 18:37:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:30,738 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-01-16 18:37:30,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-01-16 18:37:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:30,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:30,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:30,739 INFO L426 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2111303637, now seen corresponding path program 700 times [2020-01-16 18:37:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921691218] [2020-01-16 18:37:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:31,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-01-16 18:37:31,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921691218] [2020-01-16 18:37:31,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:31,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:31,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219561148] [2020-01-16 18:37:31,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:31,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:31,109 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:37:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:31,239 INFO L93 Difference]: Finished difference Result 1432 states and 4973 transitions. [2020-01-16 18:37:31,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:31,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:31,243 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:37:31,243 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:37:31,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:37:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-01-16 18:37:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:37:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3125 transitions. [2020-01-16 18:37:31,264 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3125 transitions. Word has length 25 [2020-01-16 18:37:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:31,264 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3125 transitions. [2020-01-16 18:37:31,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3125 transitions. [2020-01-16 18:37:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:31,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:31,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:31,265 INFO L426 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1100075175, now seen corresponding path program 701 times [2020-01-16 18:37:31,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:31,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331978472] [2020-01-16 18:37:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:31,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-01-16 18:37:31,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331978472] [2020-01-16 18:37:31,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:31,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:31,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376248421] [2020-01-16 18:37:31,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:31,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:31,646 INFO L87 Difference]: Start difference. First operand 791 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:37:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:31,773 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-01-16 18:37:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:31,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:31,776 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:37:31,776 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:37:31,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:37:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 796. [2020-01-16 18:37:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:37:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3134 transitions. [2020-01-16 18:37:31,798 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3134 transitions. Word has length 25 [2020-01-16 18:37:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:31,798 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3134 transitions. [2020-01-16 18:37:31,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3134 transitions. [2020-01-16 18:37:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:31,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:31,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:31,799 INFO L426 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 510865783, now seen corresponding path program 702 times [2020-01-16 18:37:31,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:31,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389687273] [2020-01-16 18:37:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:32,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-01-16 18:37:32,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389687273] [2020-01-16 18:37:32,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:32,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:32,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798915323] [2020-01-16 18:37:32,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:32,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:32,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:32,165 INFO L87 Difference]: Start difference. First operand 796 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:37:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:32,311 INFO L93 Difference]: Finished difference Result 1438 states and 4982 transitions. [2020-01-16 18:37:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:32,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:32,315 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:37:32,315 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:37:32,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:37:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 788. [2020-01-16 18:37:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:37:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3117 transitions. [2020-01-16 18:37:32,337 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3117 transitions. Word has length 25 [2020-01-16 18:37:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:32,337 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3117 transitions. [2020-01-16 18:37:32,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3117 transitions. [2020-01-16 18:37:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:32,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:32,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:32,339 INFO L426 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1879073643, now seen corresponding path program 703 times [2020-01-16 18:37:32,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:32,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178721363] [2020-01-16 18:37:32,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:32,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-01-16 18:37:32,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178721363] [2020-01-16 18:37:32,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:32,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:32,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490163716] [2020-01-16 18:37:32,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:32,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:32,704 INFO L87 Difference]: Start difference. First operand 788 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:37:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:32,854 INFO L93 Difference]: Finished difference Result 1443 states and 4999 transitions. [2020-01-16 18:37:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:32,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:32,858 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:37:32,858 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:37:32,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:37:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 796. [2020-01-16 18:37:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:37:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3138 transitions. [2020-01-16 18:37:32,880 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3138 transitions. Word has length 25 [2020-01-16 18:37:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:32,880 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3138 transitions. [2020-01-16 18:37:32,880 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3138 transitions. [2020-01-16 18:37:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:32,881 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:32,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:32,881 INFO L426 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash -268132685, now seen corresponding path program 704 times [2020-01-16 18:37:32,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:32,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080444713] [2020-01-16 18:37:32,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:33,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080444713] [2020-01-16 18:37:33,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:33,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:33,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67012720] [2020-01-16 18:37:33,249 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:33,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:33,250 INFO L87 Difference]: Start difference. First operand 796 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:37:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:33,378 INFO L93 Difference]: Finished difference Result 1447 states and 5004 transitions. [2020-01-16 18:37:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:33,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:33,381 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:37:33,382 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:37:33,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:37:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-01-16 18:37:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-01-16 18:37:33,403 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-01-16 18:37:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:33,403 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-01-16 18:37:33,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-01-16 18:37:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:33,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:33,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:33,405 INFO L426 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:33,405 INFO L82 PathProgramCache]: Analyzing trace with hash -784982055, now seen corresponding path program 705 times [2020-01-16 18:37:33,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:33,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636653480] [2020-01-16 18:37:33,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:33,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636653480] [2020-01-16 18:37:33,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:33,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:33,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948130160] [2020-01-16 18:37:33,775 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:33,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:33,776 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:37:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:33,902 INFO L93 Difference]: Finished difference Result 1446 states and 5001 transitions. [2020-01-16 18:37:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:33,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:33,906 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:37:33,906 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:37:33,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:37:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:37:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:37:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3137 transitions. [2020-01-16 18:37:33,928 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3137 transitions. Word has length 25 [2020-01-16 18:37:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:33,928 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3137 transitions. [2020-01-16 18:37:33,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3137 transitions. [2020-01-16 18:37:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:33,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:33,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:33,930 INFO L426 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash -247126477, now seen corresponding path program 706 times [2020-01-16 18:37:33,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:33,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498024207] [2020-01-16 18:37:33,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:34,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-01-16 18:37:34,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498024207] [2020-01-16 18:37:34,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:34,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:34,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129412219] [2020-01-16 18:37:34,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:34,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:34,300 INFO L87 Difference]: Start difference. First operand 797 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:37:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:34,407 INFO L93 Difference]: Finished difference Result 1452 states and 5009 transitions. [2020-01-16 18:37:34,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:34,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:34,411 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:37:34,411 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:37:34,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:37:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:37:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:37:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3126 transitions. [2020-01-16 18:37:34,433 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3126 transitions. Word has length 25 [2020-01-16 18:37:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:34,433 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3126 transitions. [2020-01-16 18:37:34,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3126 transitions. [2020-01-16 18:37:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:34,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:34,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:34,434 INFO L426 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash -774478951, now seen corresponding path program 707 times [2020-01-16 18:37:34,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:34,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361413242] [2020-01-16 18:37:34,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:34,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361413242] [2020-01-16 18:37:34,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:34,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:34,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231990118] [2020-01-16 18:37:34,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:34,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:34,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:34,843 INFO L87 Difference]: Start difference. First operand 793 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:37:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:34,977 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-01-16 18:37:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:34,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:34,981 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:37:34,981 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:37:34,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:37:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2020-01-16 18:37:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:37:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3142 transitions. [2020-01-16 18:37:35,003 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3142 transitions. Word has length 25 [2020-01-16 18:37:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:35,003 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3142 transitions. [2020-01-16 18:37:35,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3142 transitions. [2020-01-16 18:37:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:35,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:35,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:35,005 INFO L426 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1847564331, now seen corresponding path program 708 times [2020-01-16 18:37:35,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:35,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223248939] [2020-01-16 18:37:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:35,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223248939] [2020-01-16 18:37:35,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:35,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:35,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561430320] [2020-01-16 18:37:35,394 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:35,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:35,394 INFO L87 Difference]: Start difference. First operand 802 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:37:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:35,502 INFO L93 Difference]: Finished difference Result 1461 states and 5022 transitions. [2020-01-16 18:37:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:35,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:35,505 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:37:35,506 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:37:35,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:37:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 788. [2020-01-16 18:37:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:37:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3112 transitions. [2020-01-16 18:37:35,526 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3112 transitions. Word has length 25 [2020-01-16 18:37:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:35,526 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3112 transitions. [2020-01-16 18:37:35,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3112 transitions. [2020-01-16 18:37:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:35,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:35,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:35,528 INFO L426 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1553477419, now seen corresponding path program 709 times [2020-01-16 18:37:35,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:35,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470706477] [2020-01-16 18:37:35,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470706477] [2020-01-16 18:37:35,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:35,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:35,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428783851] [2020-01-16 18:37:35,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:35,905 INFO L87 Difference]: Start difference. First operand 788 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:37:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:36,057 INFO L93 Difference]: Finished difference Result 1435 states and 4977 transitions. [2020-01-16 18:37:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:36,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:36,061 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:37:36,061 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:37:36,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:37:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 795. [2020-01-16 18:37:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3131 transitions. [2020-01-16 18:37:36,082 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3131 transitions. Word has length 25 [2020-01-16 18:37:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:36,082 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3131 transitions. [2020-01-16 18:37:36,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3131 transitions. [2020-01-16 18:37:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:36,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:36,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:36,083 INFO L426 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1668404497, now seen corresponding path program 710 times [2020-01-16 18:37:36,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:36,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807568317] [2020-01-16 18:37:36,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:36,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807568317] [2020-01-16 18:37:36,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:36,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:36,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061308195] [2020-01-16 18:37:36,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:36,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:36,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:36,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:36,464 INFO L87 Difference]: Start difference. First operand 795 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:37:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:36,596 INFO L93 Difference]: Finished difference Result 1437 states and 4978 transitions. [2020-01-16 18:37:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:36,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:36,600 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:37:36,600 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:37:36,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:37:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 792. [2020-01-16 18:37:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:37:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3123 transitions. [2020-01-16 18:37:36,622 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3123 transitions. Word has length 25 [2020-01-16 18:37:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:36,622 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3123 transitions. [2020-01-16 18:37:36,622 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3123 transitions. [2020-01-16 18:37:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:36,623 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:36,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:36,623 INFO L426 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1141052023, now seen corresponding path program 711 times [2020-01-16 18:37:36,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:36,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950023116] [2020-01-16 18:37:36,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:36,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-01-16 18:37:36,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950023116] [2020-01-16 18:37:36,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:36,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:36,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224494816] [2020-01-16 18:37:36,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:36,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:36,990 INFO L87 Difference]: Start difference. First operand 792 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:37:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:37,120 INFO L93 Difference]: Finished difference Result 1440 states and 4983 transitions. [2020-01-16 18:37:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:37,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:37,123 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:37:37,123 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:37:37,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:37:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 796. [2020-01-16 18:37:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:37:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3130 transitions. [2020-01-16 18:37:37,144 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3130 transitions. Word has length 25 [2020-01-16 18:37:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:37,144 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3130 transitions. [2020-01-16 18:37:37,144 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3130 transitions. [2020-01-16 18:37:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:37,145 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:37,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] [2020-01-16 18:37:37,145 INFO L426 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1678907601, now seen corresponding path program 712 times [2020-01-16 18:37:37,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:37,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042036561] [2020-01-16 18:37:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:37,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042036561] [2020-01-16 18:37:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:37,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672875278] [2020-01-16 18:37:37,534 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:37,534 INFO L87 Difference]: Start difference. First operand 796 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:37:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:37,639 INFO L93 Difference]: Finished difference Result 1446 states and 4991 transitions. [2020-01-16 18:37:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:37,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:37,643 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:37:37,643 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:37:37,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:37:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-01-16 18:37:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:37:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3119 transitions. [2020-01-16 18:37:37,664 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3119 transitions. Word has length 25 [2020-01-16 18:37:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:37,664 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3119 transitions. [2020-01-16 18:37:37,664 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3119 transitions. [2020-01-16 18:37:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:37,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:37,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:37,666 INFO L426 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1162058231, now seen corresponding path program 713 times [2020-01-16 18:37:37,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:37,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459699893] [2020-01-16 18:37:37,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:38,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459699893] [2020-01-16 18:37:38,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:38,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:38,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38362790] [2020-01-16 18:37:38,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:38,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:38,045 INFO L87 Difference]: Start difference. First operand 792 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:37:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:38,174 INFO L93 Difference]: Finished difference Result 1446 states and 4993 transitions. [2020-01-16 18:37:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:38,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:38,178 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:37:38,178 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:37:38,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:37:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-01-16 18:37:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:37:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3130 transitions. [2020-01-16 18:37:38,199 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3130 transitions. Word has length 25 [2020-01-16 18:37:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:38,199 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3130 transitions. [2020-01-16 18:37:38,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3130 transitions. [2020-01-16 18:37:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:38,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:38,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] [2020-01-16 18:37:38,200 INFO L426 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1521968107, now seen corresponding path program 714 times [2020-01-16 18:37:38,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:38,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894908879] [2020-01-16 18:37:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:38,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-01-16 18:37:38,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894908879] [2020-01-16 18:37:38,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:38,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:38,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797238999] [2020-01-16 18:37:38,586 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:38,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:38,587 INFO L87 Difference]: Start difference. First operand 798 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:37:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:38,697 INFO L93 Difference]: Finished difference Result 1450 states and 4995 transitions. [2020-01-16 18:37:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:38,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:38,701 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:37:38,701 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:37:38,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:37:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 788. [2020-01-16 18:37:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:37:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3108 transitions. [2020-01-16 18:37:38,723 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3108 transitions. Word has length 25 [2020-01-16 18:37:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:38,723 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3108 transitions. [2020-01-16 18:37:38,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3108 transitions. [2020-01-16 18:37:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:38,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:38,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:38,724 INFO L426 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 383059763, now seen corresponding path program 715 times [2020-01-16 18:37:38,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:38,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223450004] [2020-01-16 18:37:38,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:39,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-01-16 18:37:39,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223450004] [2020-01-16 18:37:39,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:39,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:39,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270982511] [2020-01-16 18:37:39,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:39,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:39,104 INFO L87 Difference]: Start difference. First operand 788 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:37:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:39,232 INFO L93 Difference]: Finished difference Result 1459 states and 5032 transitions. [2020-01-16 18:37:39,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:39,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:39,235 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:37:39,236 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:37:39,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:37:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 800. [2020-01-16 18:37:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:37:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-01-16 18:37:39,256 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-01-16 18:37:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:39,257 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-01-16 18:37:39,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-01-16 18:37:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:39,258 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:39,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:39,258 INFO L426 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1994000721, now seen corresponding path program 716 times [2020-01-16 18:37:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:39,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968689486] [2020-01-16 18:37:39,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:39,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968689486] [2020-01-16 18:37:39,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:39,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:39,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58331141] [2020-01-16 18:37:39,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:39,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:39,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:39,636 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:37:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:39,769 INFO L93 Difference]: Finished difference Result 1457 states and 5023 transitions. [2020-01-16 18:37:39,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:39,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:39,773 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:37:39,773 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:37:39,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:37:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 795. [2020-01-16 18:37:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3127 transitions. [2020-01-16 18:37:39,794 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3127 transitions. Word has length 25 [2020-01-16 18:37:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:39,794 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3127 transitions. [2020-01-16 18:37:39,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3127 transitions. [2020-01-16 18:37:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:39,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:39,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] [2020-01-16 18:37:39,795 INFO L426 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1217378091, now seen corresponding path program 717 times [2020-01-16 18:37:39,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:39,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922559839] [2020-01-16 18:37:39,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:40,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922559839] [2020-01-16 18:37:40,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:40,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:40,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212263270] [2020-01-16 18:37:40,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:40,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:40,205 INFO L87 Difference]: Start difference. First operand 795 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:37:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:40,332 INFO L93 Difference]: Finished difference Result 1467 states and 5043 transitions. [2020-01-16 18:37:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:40,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:40,335 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:37:40,335 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:37:40,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:37:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-01-16 18:37:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:37:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3143 transitions. [2020-01-16 18:37:40,356 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3143 transitions. Word has length 25 [2020-01-16 18:37:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:40,356 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3143 transitions. [2020-01-16 18:37:40,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3143 transitions. [2020-01-16 18:37:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:40,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:40,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:40,358 INFO L426 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2004503825, now seen corresponding path program 718 times [2020-01-16 18:37:40,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:40,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464780717] [2020-01-16 18:37:40,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:40,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464780717] [2020-01-16 18:37:40,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:40,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:40,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614697731] [2020-01-16 18:37:40,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:40,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:40,747 INFO L87 Difference]: Start difference. First operand 804 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:37:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:40,849 INFO L93 Difference]: Finished difference Result 1469 states and 5039 transitions. [2020-01-16 18:37:40,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:40,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:40,853 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:37:40,853 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:37:40,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:37:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 795. [2020-01-16 18:37:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:37:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3120 transitions. [2020-01-16 18:37:40,874 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3120 transitions. Word has length 25 [2020-01-16 18:37:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:40,874 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3120 transitions. [2020-01-16 18:37:40,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3120 transitions. [2020-01-16 18:37:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:40,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:40,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:40,875 INFO L426 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1206874987, now seen corresponding path program 719 times [2020-01-16 18:37:40,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:40,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874220741] [2020-01-16 18:37:40,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:41,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874220741] [2020-01-16 18:37:41,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:41,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:41,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73966780] [2020-01-16 18:37:41,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:41,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:41,256 INFO L87 Difference]: Start difference. First operand 795 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:37:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:41,383 INFO L93 Difference]: Finished difference Result 1460 states and 5021 transitions. [2020-01-16 18:37:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:41,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:41,387 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:37:41,387 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:37:41,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:37:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 801. [2020-01-16 18:37:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:37:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3131 transitions. [2020-01-16 18:37:41,409 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3131 transitions. Word has length 25 [2020-01-16 18:37:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:41,409 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3131 transitions. [2020-01-16 18:37:41,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3131 transitions. [2020-01-16 18:37:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:41,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:41,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:41,410 INFO L426 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 404065971, now seen corresponding path program 720 times [2020-01-16 18:37:41,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:41,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155432498] [2020-01-16 18:37:41,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:41,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155432498] [2020-01-16 18:37:41,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:41,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:41,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744173044] [2020-01-16 18:37:41,797 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:41,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:41,798 INFO L87 Difference]: Start difference. First operand 801 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:37:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:41,911 INFO L93 Difference]: Finished difference Result 1464 states and 5023 transitions. [2020-01-16 18:37:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:41,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:41,915 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:37:41,915 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:37:41,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:37:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 767. [2020-01-16 18:37:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-01-16 18:37:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3065 transitions. [2020-01-16 18:37:41,936 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3065 transitions. Word has length 25 [2020-01-16 18:37:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:41,936 INFO L478 AbstractCegarLoop]: Abstraction has 767 states and 3065 transitions. [2020-01-16 18:37:41,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3065 transitions. [2020-01-16 18:37:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:41,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:41,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:41,938 INFO L426 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1154951873, now seen corresponding path program 721 times [2020-01-16 18:37:41,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:41,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122803977] [2020-01-16 18:37:41,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:42,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122803977] [2020-01-16 18:37:42,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:42,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:42,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374266548] [2020-01-16 18:37:42,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:42,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:42,299 INFO L87 Difference]: Start difference. First operand 767 states and 3065 transitions. Second operand 10 states. [2020-01-16 18:37:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:42,428 INFO L93 Difference]: Finished difference Result 1241 states and 4395 transitions. [2020-01-16 18:37:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:42,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:42,432 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:37:42,432 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:37:42,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:37:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-01-16 18:37:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:37:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:37:42,453 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:37:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:42,453 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:37:42,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:37:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:42,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:42,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:42,454 INFO L426 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash -184700259, now seen corresponding path program 722 times [2020-01-16 18:37:42,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:42,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010838154] [2020-01-16 18:37:42,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:42,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010838154] [2020-01-16 18:37:42,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:42,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:42,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692280186] [2020-01-16 18:37:42,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:42,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:42,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:42,834 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:37:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:42,965 INFO L93 Difference]: Finished difference Result 1243 states and 4395 transitions. [2020-01-16 18:37:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:42,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:42,969 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:37:42,969 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:37:42,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:37:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:37:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3117 transitions. [2020-01-16 18:37:42,990 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3117 transitions. Word has length 25 [2020-01-16 18:37:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:42,990 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3117 transitions. [2020-01-16 18:37:42,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3117 transitions. [2020-01-16 18:37:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:42,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:42,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:42,991 INFO L426 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 771082205, now seen corresponding path program 723 times [2020-01-16 18:37:42,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:42,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854579642] [2020-01-16 18:37:42,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:43,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854579642] [2020-01-16 18:37:43,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:43,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:43,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997010600] [2020-01-16 18:37:43,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:43,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:43,455 INFO L87 Difference]: Start difference. First operand 778 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:37:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:43,588 INFO L93 Difference]: Finished difference Result 1237 states and 4383 transitions. [2020-01-16 18:37:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:43,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:43,591 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:37:43,591 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:37:43,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:37:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-01-16 18:37:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3122 transitions. [2020-01-16 18:37:43,614 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3122 transitions. Word has length 25 [2020-01-16 18:37:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:43,614 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3122 transitions. [2020-01-16 18:37:43,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3122 transitions. [2020-01-16 18:37:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:43,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:43,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:43,615 INFO L426 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1751836923, now seen corresponding path program 724 times [2020-01-16 18:37:43,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:43,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850792248] [2020-01-16 18:37:43,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:43,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850792248] [2020-01-16 18:37:43,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:43,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:43,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768691169] [2020-01-16 18:37:43,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:43,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:43,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:43,993 INFO L87 Difference]: Start difference. First operand 781 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:37:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:44,145 INFO L93 Difference]: Finished difference Result 1236 states and 4378 transitions. [2020-01-16 18:37:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:44,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:44,149 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:37:44,149 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:37:44,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:37:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-01-16 18:37:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-01-16 18:37:44,169 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-01-16 18:37:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:44,169 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-01-16 18:37:44,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-01-16 18:37:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:44,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:44,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:44,170 INFO L426 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 153924927, now seen corresponding path program 725 times [2020-01-16 18:37:44,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:44,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790841424] [2020-01-16 18:37:44,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:44,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790841424] [2020-01-16 18:37:44,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:44,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:44,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462782127] [2020-01-16 18:37:44,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:44,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:44,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:44,534 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:37:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:44,664 INFO L93 Difference]: Finished difference Result 1241 states and 4388 transitions. [2020-01-16 18:37:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:44,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:44,667 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:37:44,667 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:37:44,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:37:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:37:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:37:44,688 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:37:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:44,688 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:37:44,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:37:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:44,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:44,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:44,689 INFO L426 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1764865885, now seen corresponding path program 726 times [2020-01-16 18:37:44,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:44,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017715751] [2020-01-16 18:37:44,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:45,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017715751] [2020-01-16 18:37:45,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:45,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:45,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884143642] [2020-01-16 18:37:45,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:45,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:45,054 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:37:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:45,191 INFO L93 Difference]: Finished difference Result 1238 states and 4379 transitions. [2020-01-16 18:37:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:45,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:45,194 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:37:45,195 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:37:45,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:37:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-01-16 18:37:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:37:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3106 transitions. [2020-01-16 18:37:45,228 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3106 transitions. Word has length 25 [2020-01-16 18:37:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:45,228 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3106 transitions. [2020-01-16 18:37:45,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3106 transitions. [2020-01-16 18:37:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:45,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:45,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:45,229 INFO L426 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1577437599, now seen corresponding path program 727 times [2020-01-16 18:37:45,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:45,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368644457] [2020-01-16 18:37:45,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:45,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368644457] [2020-01-16 18:37:45,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:45,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:45,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400495664] [2020-01-16 18:37:45,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:45,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:45,590 INFO L87 Difference]: Start difference. First operand 775 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:37:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:45,723 INFO L93 Difference]: Finished difference Result 1250 states and 4416 transitions. [2020-01-16 18:37:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:45,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:45,726 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:37:45,726 INFO L226 Difference]: Without dead ends: 1237 [2020-01-16 18:37:45,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-01-16 18:37:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 783. [2020-01-16 18:37:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3128 transitions. [2020-01-16 18:37:45,747 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3128 transitions. Word has length 25 [2020-01-16 18:37:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:45,747 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3128 transitions. [2020-01-16 18:37:45,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3128 transitions. [2020-01-16 18:37:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:45,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:45,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:45,748 INFO L426 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -607185985, now seen corresponding path program 728 times [2020-01-16 18:37:45,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:45,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114962254] [2020-01-16 18:37:45,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:46,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-01-16 18:37:46,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114962254] [2020-01-16 18:37:46,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:46,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:46,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974326447] [2020-01-16 18:37:46,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:46,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:46,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:46,131 INFO L87 Difference]: Start difference. First operand 783 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:37:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:46,292 INFO L93 Difference]: Finished difference Result 1252 states and 4416 transitions. [2020-01-16 18:37:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:46,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:46,295 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:37:46,295 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:37:46,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:37:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 779. [2020-01-16 18:37:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:37:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3117 transitions. [2020-01-16 18:37:46,315 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3117 transitions. Word has length 25 [2020-01-16 18:37:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:46,315 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3117 transitions. [2020-01-16 18:37:46,315 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3117 transitions. [2020-01-16 18:37:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:46,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:46,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:46,316 INFO L426 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:46,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:46,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2020336739, now seen corresponding path program 729 times [2020-01-16 18:37:46,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:46,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143915942] [2020-01-16 18:37:46,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:46,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-01-16 18:37:46,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143915942] [2020-01-16 18:37:46,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:46,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:46,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363752707] [2020-01-16 18:37:46,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:46,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:46,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:46,677 INFO L87 Difference]: Start difference. First operand 779 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:37:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:46,809 INFO L93 Difference]: Finished difference Result 1251 states and 4414 transitions. [2020-01-16 18:37:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:46,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:46,813 INFO L225 Difference]: With dead ends: 1251 [2020-01-16 18:37:46,813 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:37:46,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:37:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-01-16 18:37:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-01-16 18:37:46,833 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-01-16 18:37:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:46,833 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-01-16 18:37:46,833 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-01-16 18:37:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:46,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:46,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:46,834 INFO L426 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1029078917, now seen corresponding path program 730 times [2020-01-16 18:37:46,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433074451] [2020-01-16 18:37:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:47,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433074451] [2020-01-16 18:37:47,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:47,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:47,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949451250] [2020-01-16 18:37:47,198 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:47,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:47,198 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:37:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:47,336 INFO L93 Difference]: Finished difference Result 1254 states and 4416 transitions. [2020-01-16 18:37:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:47,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:47,340 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:37:47,340 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:37:47,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:37:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 779. [2020-01-16 18:37:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:37:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-01-16 18:37:47,360 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-01-16 18:37:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:47,361 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-01-16 18:37:47,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-01-16 18:37:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:47,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:47,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:47,362 INFO L426 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 57035425, now seen corresponding path program 731 times [2020-01-16 18:37:47,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:47,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344594178] [2020-01-16 18:37:47,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:47,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-01-16 18:37:47,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344594178] [2020-01-16 18:37:47,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109710710] [2020-01-16 18:37:47,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:47,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:47,746 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:37:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:47,876 INFO L93 Difference]: Finished difference Result 1257 states and 4424 transitions. [2020-01-16 18:37:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:47,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:47,879 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:37:47,879 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:37:47,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:37:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 785. [2020-01-16 18:37:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:37:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3124 transitions. [2020-01-16 18:37:47,900 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3124 transitions. Word has length 25 [2020-01-16 18:37:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:47,900 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3124 transitions. [2020-01-16 18:37:47,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3124 transitions. [2020-01-16 18:37:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:47,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:47,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:47,901 INFO L426 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1016049955, now seen corresponding path program 732 times [2020-01-16 18:37:47,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:47,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54481320] [2020-01-16 18:37:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:48,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54481320] [2020-01-16 18:37:48,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:48,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:48,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594182568] [2020-01-16 18:37:48,262 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:48,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:48,262 INFO L87 Difference]: Start difference. First operand 785 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:37:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:48,406 INFO L93 Difference]: Finished difference Result 1258 states and 4420 transitions. [2020-01-16 18:37:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:48,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:48,410 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:37:48,410 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:37:48,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:37:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 775. [2020-01-16 18:37:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:37:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-01-16 18:37:48,430 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-01-16 18:37:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:48,430 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-01-16 18:37:48,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-01-16 18:37:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:48,431 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:48,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:48,432 INFO L426 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash -73889247, now seen corresponding path program 733 times [2020-01-16 18:37:48,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:48,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22537702] [2020-01-16 18:37:48,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:48,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22537702] [2020-01-16 18:37:48,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:48,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:48,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743192462] [2020-01-16 18:37:48,804 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:48,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:48,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:48,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:48,804 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:37:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:48,936 INFO L93 Difference]: Finished difference Result 1238 states and 4382 transitions. [2020-01-16 18:37:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:48,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:48,939 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:37:48,940 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:37:48,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:37:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-01-16 18:37:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:37:48,960 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:37:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:48,960 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:37:48,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:37:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:48,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:48,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:48,961 INFO L426 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 906865471, now seen corresponding path program 734 times [2020-01-16 18:37:48,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:48,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596972935] [2020-01-16 18:37:48,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:49,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596972935] [2020-01-16 18:37:49,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:49,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:49,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250754316] [2020-01-16 18:37:49,331 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:49,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:49,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:49,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:49,331 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:37:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:49,469 INFO L93 Difference]: Finished difference Result 1237 states and 4377 transitions. [2020-01-16 18:37:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:49,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:49,472 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:37:49,472 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:37:49,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:37:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-01-16 18:37:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-01-16 18:37:49,492 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-01-16 18:37:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:49,493 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-01-16 18:37:49,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-01-16 18:37:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:49,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:49,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:49,494 INFO L426 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1852144831, now seen corresponding path program 735 times [2020-01-16 18:37:49,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:49,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034736517] [2020-01-16 18:37:49,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:49,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034736517] [2020-01-16 18:37:49,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:49,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:49,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725173527] [2020-01-16 18:37:49,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:49,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:49,854 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:37:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:49,992 INFO L93 Difference]: Finished difference Result 1243 states and 4390 transitions. [2020-01-16 18:37:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:49,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:49,996 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:37:49,996 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:37:49,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:37:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 782. [2020-01-16 18:37:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:37:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-01-16 18:37:50,016 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-01-16 18:37:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:50,016 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-01-16 18:37:50,016 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-01-16 18:37:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:50,017 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:50,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:50,018 INFO L426 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1451564643, now seen corresponding path program 736 times [2020-01-16 18:37:50,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:50,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138301704] [2020-01-16 18:37:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:50,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-01-16 18:37:50,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138301704] [2020-01-16 18:37:50,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:50,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:50,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311230365] [2020-01-16 18:37:50,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:50,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:50,378 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:37:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:50,520 INFO L93 Difference]: Finished difference Result 1246 states and 4392 transitions. [2020-01-16 18:37:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:50,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:50,523 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:37:50,524 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:37:50,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:37:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 778. [2020-01-16 18:37:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:37:50,544 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:37:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:50,544 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:37:50,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:37:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:50,545 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:50,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:50,546 INFO L426 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1571086881, now seen corresponding path program 737 times [2020-01-16 18:37:50,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:50,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806363406] [2020-01-16 18:37:50,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:50,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806363406] [2020-01-16 18:37:50,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:50,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:50,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255848623] [2020-01-16 18:37:50,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:50,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:50,906 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:37:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:51,052 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-01-16 18:37:51,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:51,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:51,055 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:37:51,055 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:37:51,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:37:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-01-16 18:37:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:37:51,075 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:37:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:51,075 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:37:51,075 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:37:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:51,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:51,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:51,077 INFO L426 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1112939457, now seen corresponding path program 738 times [2020-01-16 18:37:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984838862] [2020-01-16 18:37:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:51,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984838862] [2020-01-16 18:37:51,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:51,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:51,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015113013] [2020-01-16 18:37:51,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:51,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:51,444 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:37:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:51,590 INFO L93 Difference]: Finished difference Result 1244 states and 4385 transitions. [2020-01-16 18:37:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:51,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:51,594 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:37:51,594 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:37:51,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:37:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 775. [2020-01-16 18:37:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:37:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-01-16 18:37:51,614 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-01-16 18:37:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:51,614 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-01-16 18:37:51,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-01-16 18:37:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:51,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:51,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:51,615 INFO L426 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -730047843, now seen corresponding path program 739 times [2020-01-16 18:37:51,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:51,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855511462] [2020-01-16 18:37:51,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:51,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855511462] [2020-01-16 18:37:51,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:51,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:51,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565245713] [2020-01-16 18:37:51,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:51,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:51,993 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:37:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:52,143 INFO L93 Difference]: Finished difference Result 1246 states and 4397 transitions. [2020-01-16 18:37:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:52,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:52,146 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:37:52,146 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:37:52,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:37:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-01-16 18:37:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:37:52,167 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:37:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:52,167 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:37:52,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:37:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:52,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:52,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:52,168 INFO L426 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 880893115, now seen corresponding path program 740 times [2020-01-16 18:37:52,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:52,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169226549] [2020-01-16 18:37:52,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:52,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-01-16 18:37:52,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169226549] [2020-01-16 18:37:52,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:52,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:52,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186311201] [2020-01-16 18:37:52,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:52,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:52,537 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:37:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:52,721 INFO L93 Difference]: Finished difference Result 1243 states and 4388 transitions. [2020-01-16 18:37:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:52,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:52,724 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:37:52,724 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:37:52,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:37:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 778. [2020-01-16 18:37:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:37:52,744 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:37:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:52,744 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:37:52,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:37:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:52,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:52,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:52,745 INFO L426 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1964481599, now seen corresponding path program 741 times [2020-01-16 18:37:52,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:52,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013574710] [2020-01-16 18:37:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:53,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013574710] [2020-01-16 18:37:53,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:53,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:53,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786989823] [2020-01-16 18:37:53,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:53,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:53,120 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:37:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:53,256 INFO L93 Difference]: Finished difference Result 1253 states and 4411 transitions. [2020-01-16 18:37:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:53,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:53,259 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:37:53,259 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:37:53,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:37:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 784. [2020-01-16 18:37:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:37:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:37:53,279 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:37:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:53,279 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:37:53,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:37:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:53,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:53,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:53,281 INFO L426 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash 891396219, now seen corresponding path program 742 times [2020-01-16 18:37:53,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:53,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503841934] [2020-01-16 18:37:53,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:53,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-01-16 18:37:53,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503841934] [2020-01-16 18:37:53,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:53,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:53,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299269264] [2020-01-16 18:37:53,653 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:53,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:53,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:53,653 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:37:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:53,795 INFO L93 Difference]: Finished difference Result 1254 states and 4407 transitions. [2020-01-16 18:37:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:53,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:53,798 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:37:53,798 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:37:53,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:37:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-01-16 18:37:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:37:53,819 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:37:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:53,819 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:37:53,819 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:37:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:53,820 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:53,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:53,820 INFO L426 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1974984703, now seen corresponding path program 743 times [2020-01-16 18:37:53,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:53,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202399317] [2020-01-16 18:37:53,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:54,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202399317] [2020-01-16 18:37:54,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:54,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:54,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278899943] [2020-01-16 18:37:54,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:54,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:54,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:54,206 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:37:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:54,366 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:37:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:54,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:54,370 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:37:54,370 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:37:54,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:37:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:37:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:37:54,391 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:37:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:54,391 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:37:54,391 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:37:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:54,392 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:54,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:54,392 INFO L426 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash -709041635, now seen corresponding path program 744 times [2020-01-16 18:37:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:54,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396577968] [2020-01-16 18:37:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:54,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396577968] [2020-01-16 18:37:54,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:54,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:54,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444667192] [2020-01-16 18:37:54,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:54,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:54,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:54,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:54,756 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:37:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:54,900 INFO L93 Difference]: Finished difference Result 1248 states and 4392 transitions. [2020-01-16 18:37:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:54,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:54,904 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:37:54,904 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:37:54,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:37:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 772. [2020-01-16 18:37:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:37:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3092 transitions. [2020-01-16 18:37:54,924 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3092 transitions. Word has length 25 [2020-01-16 18:37:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:54,924 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3092 transitions. [2020-01-16 18:37:54,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3092 transitions. [2020-01-16 18:37:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:54,925 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:54,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:54,925 INFO L426 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1367107491, now seen corresponding path program 745 times [2020-01-16 18:37:54,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:54,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366706165] [2020-01-16 18:37:54,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:55,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-01-16 18:37:55,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366706165] [2020-01-16 18:37:55,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:55,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702575577] [2020-01-16 18:37:55,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:55,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:55,297 INFO L87 Difference]: Start difference. First operand 772 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:37:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:55,439 INFO L93 Difference]: Finished difference Result 1238 states and 4385 transitions. [2020-01-16 18:37:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:55,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:55,442 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:37:55,442 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:37:55,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:37:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 782. [2020-01-16 18:37:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:37:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-01-16 18:37:55,463 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-01-16 18:37:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:55,463 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-01-16 18:37:55,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-01-16 18:37:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:55,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:55,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:55,464 INFO L426 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -396855877, now seen corresponding path program 746 times [2020-01-16 18:37:55,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:55,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619887722] [2020-01-16 18:37:55,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:55,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619887722] [2020-01-16 18:37:55,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:55,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:55,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862622390] [2020-01-16 18:37:55,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:55,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:55,833 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:37:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:55,973 INFO L93 Difference]: Finished difference Result 1240 states and 4385 transitions. [2020-01-16 18:37:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:55,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:55,976 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:37:55,976 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:37:55,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:37:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-01-16 18:37:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-01-16 18:37:55,998 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-01-16 18:37:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:55,998 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-01-16 18:37:55,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-01-16 18:37:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:55,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:55,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:56,000 INFO L426 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 558926587, now seen corresponding path program 747 times [2020-01-16 18:37:56,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:56,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955232770] [2020-01-16 18:37:56,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:56,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955232770] [2020-01-16 18:37:56,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:56,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:56,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045351898] [2020-01-16 18:37:56,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:56,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:56,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:56,396 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:37:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:56,553 INFO L93 Difference]: Finished difference Result 1234 states and 4373 transitions. [2020-01-16 18:37:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:56,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:56,556 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:37:56,556 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:37:56,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:37:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:37:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:37:56,576 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:37:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:56,576 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:37:56,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:37:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:56,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:56,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:56,578 INFO L426 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1539681305, now seen corresponding path program 748 times [2020-01-16 18:37:56,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:56,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623204741] [2020-01-16 18:37:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:56,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-01-16 18:37:56,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623204741] [2020-01-16 18:37:56,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:56,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:56,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587828174] [2020-01-16 18:37:56,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:56,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:56,947 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:37:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:57,087 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-01-16 18:37:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:57,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:57,090 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:37:57,090 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:37:57,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:37:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:37:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:37:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-01-16 18:37:57,110 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-01-16 18:37:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:57,110 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-01-16 18:37:57,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-01-16 18:37:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:57,111 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:57,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:57,112 INFO L426 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -58230691, now seen corresponding path program 749 times [2020-01-16 18:37:57,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:57,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341240826] [2020-01-16 18:37:57,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341240826] [2020-01-16 18:37:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:57,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364393926] [2020-01-16 18:37:57,480 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:57,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:57,481 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:37:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:57,614 INFO L93 Difference]: Finished difference Result 1238 states and 4378 transitions. [2020-01-16 18:37:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:57,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:57,618 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:37:57,618 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:37:57,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:37:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-01-16 18:37:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:37:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:37:57,638 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:37:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:57,639 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:37:57,639 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:37:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:57,640 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:57,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:57,640 INFO L426 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1552710267, now seen corresponding path program 750 times [2020-01-16 18:37:57,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:57,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412824132] [2020-01-16 18:37:57,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:58,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412824132] [2020-01-16 18:37:58,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:58,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:58,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140039425] [2020-01-16 18:37:58,003 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:58,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:58,004 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:37:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:58,165 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-01-16 18:37:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:58,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:58,168 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:37:58,168 INFO L226 Difference]: Without dead ends: 1217 [2020-01-16 18:37:58,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-01-16 18:37:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 775. [2020-01-16 18:37:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:37:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-01-16 18:37:58,189 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-01-16 18:37:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:58,189 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-01-16 18:37:58,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-01-16 18:37:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:58,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:58,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:58,190 INFO L426 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2082888353, now seen corresponding path program 751 times [2020-01-16 18:37:58,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:58,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255247702] [2020-01-16 18:37:58,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:58,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255247702] [2020-01-16 18:37:58,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:58,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:58,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150535572] [2020-01-16 18:37:58,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:58,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:58,567 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:37:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:58,751 INFO L93 Difference]: Finished difference Result 1244 states and 4399 transitions. [2020-01-16 18:37:58,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:58,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:58,755 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:37:58,755 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:37:58,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:37:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 783. [2020-01-16 18:37:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3125 transitions. [2020-01-16 18:37:58,776 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3125 transitions. Word has length 25 [2020-01-16 18:37:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:58,776 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3125 transitions. [2020-01-16 18:37:58,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3125 transitions. [2020-01-16 18:37:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:58,777 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:58,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:58,777 INFO L426 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1241827329, now seen corresponding path program 752 times [2020-01-16 18:37:58,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:58,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130811593] [2020-01-16 18:37:58,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:59,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130811593] [2020-01-16 18:37:59,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:59,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:59,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117907117] [2020-01-16 18:37:59,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:59,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:59,164 INFO L87 Difference]: Start difference. First operand 783 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:37:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:59,304 INFO L93 Difference]: Finished difference Result 1246 states and 4399 transitions. [2020-01-16 18:37:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:59,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:59,307 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:37:59,307 INFO L226 Difference]: Without dead ends: 1227 [2020-01-16 18:37:59,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-01-16 18:37:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 779. [2020-01-16 18:37:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:37:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3114 transitions. [2020-01-16 18:37:59,327 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3114 transitions. Word has length 25 [2020-01-16 18:37:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:59,327 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3114 transitions. [2020-01-16 18:37:59,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3114 transitions. [2020-01-16 18:37:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:59,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:59,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:59,329 INFO L426 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash -728944005, now seen corresponding path program 753 times [2020-01-16 18:37:59,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:59,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809566107] [2020-01-16 18:37:59,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:37:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:37:59,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809566107] [2020-01-16 18:37:59,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:37:59,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:37:59,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544117913] [2020-01-16 18:37:59,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:37:59,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:37:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:37:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:37:59,712 INFO L87 Difference]: Start difference. First operand 779 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:37:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:37:59,853 INFO L93 Difference]: Finished difference Result 1243 states and 4393 transitions. [2020-01-16 18:37:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:37:59,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:37:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:37:59,856 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:37:59,857 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:37:59,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:37:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:37:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:37:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:37:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3121 transitions. [2020-01-16 18:37:59,877 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3121 transitions. Word has length 25 [2020-01-16 18:37:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:37:59,877 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3121 transitions. [2020-01-16 18:37:59,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:37:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3121 transitions. [2020-01-16 18:37:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:37:59,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:37:59,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:37:59,878 INFO L426 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:37:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:37:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash 272816921, now seen corresponding path program 754 times [2020-01-16 18:37:59,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:37:59,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559331242] [2020-01-16 18:37:59,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:37:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:00,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559331242] [2020-01-16 18:38:00,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989223259] [2020-01-16 18:38:00,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:00,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:00,264 INFO L87 Difference]: Start difference. First operand 783 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:38:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:00,407 INFO L93 Difference]: Finished difference Result 1244 states and 4391 transitions. [2020-01-16 18:38:00,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:00,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:00,411 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:00,411 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:38:00,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:38:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:38:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:38:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3110 transitions. [2020-01-16 18:38:00,431 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:00,431 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3110 transitions. [2020-01-16 18:38:00,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3110 transitions. [2020-01-16 18:38:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:00,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:00,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:00,433 INFO L426 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash -252009695, now seen corresponding path program 755 times [2020-01-16 18:38:00,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:00,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929544784] [2020-01-16 18:38:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:00,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929544784] [2020-01-16 18:38:00,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:00,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:00,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133486512] [2020-01-16 18:38:00,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:00,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:00,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:00,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:00,811 INFO L87 Difference]: Start difference. First operand 779 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:00,951 INFO L93 Difference]: Finished difference Result 1248 states and 4400 transitions. [2020-01-16 18:38:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:00,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:00,954 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:38:00,955 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:38:00,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:38:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 784. [2020-01-16 18:38:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:38:00,975 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:38:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:00,975 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:38:00,975 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:38:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:00,976 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:00,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:00,977 INFO L426 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 285845883, now seen corresponding path program 756 times [2020-01-16 18:38:00,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:00,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019539704] [2020-01-16 18:38:00,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:01,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019539704] [2020-01-16 18:38:01,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:01,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:01,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651781716] [2020-01-16 18:38:01,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:01,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:01,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:01,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:01,359 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:38:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:01,503 INFO L93 Difference]: Finished difference Result 1247 states and 4393 transitions. [2020-01-16 18:38:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:01,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:01,507 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:38:01,507 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:01,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 775. [2020-01-16 18:38:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-01-16 18:38:01,527 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-01-16 18:38:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:01,527 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-01-16 18:38:01,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-01-16 18:38:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:01,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:01,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:01,529 INFO L426 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -708530591, now seen corresponding path program 757 times [2020-01-16 18:38:01,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:01,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984066783] [2020-01-16 18:38:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:01,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984066783] [2020-01-16 18:38:01,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:01,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:01,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103615274] [2020-01-16 18:38:01,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:01,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:01,916 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:38:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:02,075 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-01-16 18:38:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:02,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:02,078 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:38:02,079 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:38:02,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:38:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 781. [2020-01-16 18:38:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:38:02,099 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:02,099 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:38:02,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:38:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:02,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:02,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:02,101 INFO L426 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 272224127, now seen corresponding path program 758 times [2020-01-16 18:38:02,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:02,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630586560] [2020-01-16 18:38:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:02,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630586560] [2020-01-16 18:38:02,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:02,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:02,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53872631] [2020-01-16 18:38:02,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:02,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:02,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:02,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:02,478 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:02,619 INFO L93 Difference]: Finished difference Result 1232 states and 4363 transitions. [2020-01-16 18:38:02,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:02,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:02,622 INFO L225 Difference]: With dead ends: 1232 [2020-01-16 18:38:02,622 INFO L226 Difference]: Without dead ends: 1217 [2020-01-16 18:38:02,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-01-16 18:38:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 778. [2020-01-16 18:38:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:38:02,642 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:38:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:02,642 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:38:02,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:38:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:02,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:02,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:02,644 INFO L426 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1151429731, now seen corresponding path program 759 times [2020-01-16 18:38:02,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:02,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559433270] [2020-01-16 18:38:02,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:03,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559433270] [2020-01-16 18:38:03,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:03,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:03,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916677019] [2020-01-16 18:38:03,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:03,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:03,014 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:38:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:03,145 INFO L93 Difference]: Finished difference Result 1236 states and 4372 transitions. [2020-01-16 18:38:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:03,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:03,148 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:38:03,148 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:38:03,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:38:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 782. [2020-01-16 18:38:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:38:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-01-16 18:38:03,169 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-01-16 18:38:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:03,169 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-01-16 18:38:03,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-01-16 18:38:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:03,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:03,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:03,170 INFO L426 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash -149668805, now seen corresponding path program 760 times [2020-01-16 18:38:03,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:03,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012924456] [2020-01-16 18:38:03,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:03,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012924456] [2020-01-16 18:38:03,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:03,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:03,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725549603] [2020-01-16 18:38:03,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:03,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:03,550 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:38:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:03,691 INFO L93 Difference]: Finished difference Result 1237 states and 4370 transitions. [2020-01-16 18:38:03,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:03,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:03,694 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:38:03,694 INFO L226 Difference]: Without dead ends: 1219 [2020-01-16 18:38:03,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-01-16 18:38:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 778. [2020-01-16 18:38:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:03,714 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:03,714 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:03,714 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:03,715 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:03,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:03,715 INFO L426 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1262041761, now seen corresponding path program 761 times [2020-01-16 18:38:03,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:03,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34065753] [2020-01-16 18:38:03,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:04,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34065753] [2020-01-16 18:38:04,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:04,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:04,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121108324] [2020-01-16 18:38:04,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:04,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:04,090 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:04,215 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-01-16 18:38:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:04,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:04,218 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:38:04,218 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:38:04,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:38:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:38:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:38:04,238 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:04,238 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:38:04,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:38:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:04,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:04,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:04,239 INFO L426 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash 188956381, now seen corresponding path program 762 times [2020-01-16 18:38:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150804336] [2020-01-16 18:38:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:04,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-01-16 18:38:04,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150804336] [2020-01-16 18:38:04,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:04,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:04,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586033591] [2020-01-16 18:38:04,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:04,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:04,614 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:04,750 INFO L93 Difference]: Finished difference Result 1235 states and 4363 transitions. [2020-01-16 18:38:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:04,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:04,754 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:38:04,754 INFO L226 Difference]: Without dead ends: 1215 [2020-01-16 18:38:04,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-01-16 18:38:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 775. [2020-01-16 18:38:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:38:04,774 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:38:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:04,774 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:38:04,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:38:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:04,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:04,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:04,775 INFO L426 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash 561344891, now seen corresponding path program 763 times [2020-01-16 18:38:04,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:04,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217216882] [2020-01-16 18:38:04,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:05,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217216882] [2020-01-16 18:38:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:05,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:05,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284873496] [2020-01-16 18:38:05,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:05,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:05,140 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:38:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:05,274 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-01-16 18:38:05,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:05,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:05,277 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:38:05,277 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:38:05,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:38:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-01-16 18:38:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:38:05,298 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:38:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:05,298 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:38:05,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:38:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:05,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:05,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:05,299 INFO L426 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2122681447, now seen corresponding path program 764 times [2020-01-16 18:38:05,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:05,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563958538] [2020-01-16 18:38:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:05,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-01-16 18:38:05,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563958538] [2020-01-16 18:38:05,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:05,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:05,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979265872] [2020-01-16 18:38:05,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:05,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:05,722 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:38:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:05,846 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-01-16 18:38:05,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:05,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:05,849 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:38:05,849 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:38:05,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:38:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-01-16 18:38:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:05,869 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:05,869 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:05,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:05,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:05,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:05,871 INFO L426 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436479, now seen corresponding path program 765 times [2020-01-16 18:38:05,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370769163] [2020-01-16 18:38:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:06,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-01-16 18:38:06,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370769163] [2020-01-16 18:38:06,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:06,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:06,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552739079] [2020-01-16 18:38:06,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:06,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:06,242 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:06,370 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:38:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:06,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:06,374 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:06,374 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:38:06,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:38:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-01-16 18:38:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3114 transitions. [2020-01-16 18:38:06,395 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3114 transitions. Word has length 25 [2020-01-16 18:38:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:06,395 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3114 transitions. [2020-01-16 18:38:06,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3114 transitions. [2020-01-16 18:38:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:06,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:06,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:06,396 INFO L426 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2101675239, now seen corresponding path program 766 times [2020-01-16 18:38:06,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:06,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65423360] [2020-01-16 18:38:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:06,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65423360] [2020-01-16 18:38:06,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:06,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:06,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735618485] [2020-01-16 18:38:06,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:06,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:06,767 INFO L87 Difference]: Start difference. First operand 783 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:38:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:06,911 INFO L93 Difference]: Finished difference Result 1243 states and 4380 transitions. [2020-01-16 18:38:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:06,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:06,914 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:38:06,914 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:06,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:38:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:38:06,934 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:06,935 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:38:06,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:38:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:06,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:06,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:06,936 INFO L426 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1665939583, now seen corresponding path program 767 times [2020-01-16 18:38:06,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:06,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945494738] [2020-01-16 18:38:06,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:07,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945494738] [2020-01-16 18:38:07,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:07,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:07,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901836952] [2020-01-16 18:38:07,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:07,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:07,313 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:07,463 INFO L93 Difference]: Finished difference Result 1236 states and 4366 transitions. [2020-01-16 18:38:07,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:07,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:07,466 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:38:07,467 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:07,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-01-16 18:38:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:38:07,487 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:38:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:07,487 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:38:07,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:38:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:07,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:07,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:07,488 INFO L426 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 592854203, now seen corresponding path program 768 times [2020-01-16 18:38:07,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:07,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232718893] [2020-01-16 18:38:07,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:07,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-01-16 18:38:07,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232718893] [2020-01-16 18:38:07,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:07,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:07,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218525711] [2020-01-16 18:38:07,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:07,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:07,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:07,854 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:38:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:07,982 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-01-16 18:38:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:07,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:07,985 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:38:07,985 INFO L226 Difference]: Without dead ends: 1215 [2020-01-16 18:38:07,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-01-16 18:38:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 772. [2020-01-16 18:38:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:38:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3089 transitions. [2020-01-16 18:38:08,005 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3089 transitions. Word has length 25 [2020-01-16 18:38:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:08,005 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3089 transitions. [2020-01-16 18:38:08,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3089 transitions. [2020-01-16 18:38:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:08,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:08,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:08,006 INFO L426 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2001748835, now seen corresponding path program 769 times [2020-01-16 18:38:08,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:08,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975228268] [2020-01-16 18:38:08,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:08,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975228268] [2020-01-16 18:38:08,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:08,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:08,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735448025] [2020-01-16 18:38:08,365 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:08,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:08,366 INFO L87 Difference]: Start difference. First operand 772 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:38:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:08,516 INFO L93 Difference]: Finished difference Result 1262 states and 4453 transitions. [2020-01-16 18:38:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:08,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:08,519 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:38:08,519 INFO L226 Difference]: Without dead ends: 1249 [2020-01-16 18:38:08,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-01-16 18:38:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2020-01-16 18:38:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-01-16 18:38:08,540 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-01-16 18:38:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:08,540 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-01-16 18:38:08,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-01-16 18:38:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:08,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:08,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:08,541 INFO L426 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1031497221, now seen corresponding path program 770 times [2020-01-16 18:38:08,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:08,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95677110] [2020-01-16 18:38:08,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:08,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95677110] [2020-01-16 18:38:08,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:08,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:08,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856816129] [2020-01-16 18:38:08,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:08,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:08,919 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:38:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:09,058 INFO L93 Difference]: Finished difference Result 1264 states and 4453 transitions. [2020-01-16 18:38:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:09,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:09,062 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:38:09,062 INFO L226 Difference]: Without dead ends: 1245 [2020-01-16 18:38:09,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-01-16 18:38:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 780. [2020-01-16 18:38:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3119 transitions. [2020-01-16 18:38:09,082 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3119 transitions. Word has length 25 [2020-01-16 18:38:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:09,082 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3119 transitions. [2020-01-16 18:38:09,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3119 transitions. [2020-01-16 18:38:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:09,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:09,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:09,083 INFO L426 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1850319321, now seen corresponding path program 771 times [2020-01-16 18:38:09,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:09,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784118004] [2020-01-16 18:38:09,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:09,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-01-16 18:38:09,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784118004] [2020-01-16 18:38:09,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:09,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:09,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472177651] [2020-01-16 18:38:09,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:09,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:09,457 INFO L87 Difference]: Start difference. First operand 780 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:38:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:09,593 INFO L93 Difference]: Finished difference Result 1263 states and 4451 transitions. [2020-01-16 18:38:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:09,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:09,596 INFO L225 Difference]: With dead ends: 1263 [2020-01-16 18:38:09,596 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:38:09,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:38:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 784. [2020-01-16 18:38:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-01-16 18:38:09,617 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-01-16 18:38:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:09,617 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-01-16 18:38:09,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-01-16 18:38:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:09,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:09,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:09,618 INFO L426 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1453390153, now seen corresponding path program 772 times [2020-01-16 18:38:09,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:09,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176115920] [2020-01-16 18:38:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:09,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176115920] [2020-01-16 18:38:09,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:09,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:09,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952334224] [2020-01-16 18:38:09,988 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:09,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:09,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:09,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:09,989 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:38:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:10,127 INFO L93 Difference]: Finished difference Result 1266 states and 4453 transitions. [2020-01-16 18:38:10,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:10,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:10,131 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:38:10,131 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:38:10,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:38:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 780. [2020-01-16 18:38:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-01-16 18:38:10,151 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-01-16 18:38:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:10,152 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-01-16 18:38:10,152 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-01-16 18:38:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:10,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:10,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:10,153 INFO L426 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -367275811, now seen corresponding path program 773 times [2020-01-16 18:38:10,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:10,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025155852] [2020-01-16 18:38:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:10,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025155852] [2020-01-16 18:38:10,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:10,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:10,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346151232] [2020-01-16 18:38:10,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:10,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:10,528 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:38:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:10,655 INFO L93 Difference]: Finished difference Result 1269 states and 4461 transitions. [2020-01-16 18:38:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:10,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:10,658 INFO L225 Difference]: With dead ends: 1269 [2020-01-16 18:38:10,658 INFO L226 Difference]: Without dead ends: 1254 [2020-01-16 18:38:10,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2020-01-16 18:38:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 786. [2020-01-16 18:38:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:38:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3126 transitions. [2020-01-16 18:38:10,678 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3126 transitions. Word has length 25 [2020-01-16 18:38:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:10,678 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3126 transitions. [2020-01-16 18:38:10,679 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3126 transitions. [2020-01-16 18:38:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:10,680 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:10,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:10,680 INFO L426 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1440361191, now seen corresponding path program 774 times [2020-01-16 18:38:10,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:10,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878607054] [2020-01-16 18:38:10,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:11,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878607054] [2020-01-16 18:38:11,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:11,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:11,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767908398] [2020-01-16 18:38:11,052 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:11,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:11,052 INFO L87 Difference]: Start difference. First operand 786 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:38:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:11,181 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-01-16 18:38:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:11,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:11,184 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:38:11,184 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:38:11,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:38:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 776. [2020-01-16 18:38:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:38:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3104 transitions. [2020-01-16 18:38:11,205 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3104 transitions. Word has length 25 [2020-01-16 18:38:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:11,205 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3104 transitions. [2020-01-16 18:38:11,205 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3104 transitions. [2020-01-16 18:38:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:11,206 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:11,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:11,206 INFO L426 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1870732735, now seen corresponding path program 775 times [2020-01-16 18:38:11,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:11,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679789143] [2020-01-16 18:38:11,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:11,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679789143] [2020-01-16 18:38:11,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:11,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:11,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918620006] [2020-01-16 18:38:11,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:11,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:11,573 INFO L87 Difference]: Start difference. First operand 776 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:38:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:11,701 INFO L93 Difference]: Finished difference Result 1259 states and 4442 transitions. [2020-01-16 18:38:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:11,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:11,705 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:38:11,705 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:38:11,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:38:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-01-16 18:38:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-01-16 18:38:11,725 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-01-16 18:38:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:11,725 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-01-16 18:38:11,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-01-16 18:38:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:11,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:11,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:11,726 INFO L426 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1453982947, now seen corresponding path program 776 times [2020-01-16 18:38:11,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:11,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951960841] [2020-01-16 18:38:11,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:12,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-01-16 18:38:12,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951960841] [2020-01-16 18:38:12,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:12,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:12,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13355666] [2020-01-16 18:38:12,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:12,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:12,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:12,105 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:38:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:12,260 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-01-16 18:38:12,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:12,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:12,263 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:38:12,263 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:38:12,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:38:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:38:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-01-16 18:38:12,283 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-01-16 18:38:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:12,284 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-01-16 18:38:12,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-01-16 18:38:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:12,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:12,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:12,285 INFO L426 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash -941099623, now seen corresponding path program 777 times [2020-01-16 18:38:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730388532] [2020-01-16 18:38:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:12,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730388532] [2020-01-16 18:38:12,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:12,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:12,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516153305] [2020-01-16 18:38:12,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:12,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:12,662 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:38:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:12,803 INFO L93 Difference]: Finished difference Result 1258 states and 4436 transitions. [2020-01-16 18:38:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:12,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:12,807 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:38:12,807 INFO L226 Difference]: Without dead ends: 1245 [2020-01-16 18:38:12,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-01-16 18:38:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 784. [2020-01-16 18:38:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-01-16 18:38:12,829 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-01-16 18:38:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:12,829 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-01-16 18:38:12,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-01-16 18:38:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:12,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:12,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:12,830 INFO L426 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 60661303, now seen corresponding path program 778 times [2020-01-16 18:38:12,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:12,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959127298] [2020-01-16 18:38:12,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:13,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959127298] [2020-01-16 18:38:13,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:13,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:13,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881124762] [2020-01-16 18:38:13,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:13,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:13,205 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:38:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:13,335 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-01-16 18:38:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:13,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:13,339 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:38:13,339 INFO L226 Difference]: Without dead ends: 1241 [2020-01-16 18:38:13,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-01-16 18:38:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 780. [2020-01-16 18:38:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:38:13,359 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:13,359 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:38:13,359 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:38:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:13,360 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:13,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:13,360 INFO L426 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash -464165313, now seen corresponding path program 779 times [2020-01-16 18:38:13,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:13,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661816031] [2020-01-16 18:38:13,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:13,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-01-16 18:38:13,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661816031] [2020-01-16 18:38:13,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:13,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:13,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277100849] [2020-01-16 18:38:13,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:13,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:13,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:13,748 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:13,876 INFO L93 Difference]: Finished difference Result 1263 states and 4443 transitions. [2020-01-16 18:38:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:13,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:13,880 INFO L225 Difference]: With dead ends: 1263 [2020-01-16 18:38:13,880 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:38:13,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:38:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-01-16 18:38:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:38:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-01-16 18:38:13,900 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-01-16 18:38:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:13,900 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-01-16 18:38:13,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-01-16 18:38:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:13,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:13,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:13,901 INFO L426 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 73690265, now seen corresponding path program 780 times [2020-01-16 18:38:13,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:13,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22406616] [2020-01-16 18:38:13,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:14,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22406616] [2020-01-16 18:38:14,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:14,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:14,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981447341] [2020-01-16 18:38:14,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:14,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:14,277 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:38:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:14,430 INFO L93 Difference]: Finished difference Result 1262 states and 4436 transitions. [2020-01-16 18:38:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:14,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:14,433 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:38:14,434 INFO L226 Difference]: Without dead ends: 1239 [2020-01-16 18:38:14,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-01-16 18:38:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 776. [2020-01-16 18:38:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:38:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-01-16 18:38:14,454 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-01-16 18:38:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:14,454 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-01-16 18:38:14,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-01-16 18:38:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:14,455 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:14,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:14,456 INFO L426 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash 582862143, now seen corresponding path program 781 times [2020-01-16 18:38:14,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:14,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940200080] [2020-01-16 18:38:14,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:14,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940200080] [2020-01-16 18:38:14,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:14,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:14,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637277268] [2020-01-16 18:38:14,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:14,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:14,825 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:38:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:14,960 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-01-16 18:38:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:14,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:14,964 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:38:14,964 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:38:14,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:38:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 784. [2020-01-16 18:38:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-01-16 18:38:14,984 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-01-16 18:38:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:14,984 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-01-16 18:38:14,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-01-16 18:38:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:14,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:14,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:14,985 INFO L426 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1574119965, now seen corresponding path program 782 times [2020-01-16 18:38:14,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:14,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720883817] [2020-01-16 18:38:14,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:15,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720883817] [2020-01-16 18:38:15,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:15,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:15,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881687728] [2020-01-16 18:38:15,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:15,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:15,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:15,364 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:38:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:15,508 INFO L93 Difference]: Finished difference Result 1264 states and 4444 transitions. [2020-01-16 18:38:15,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:15,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:15,512 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:38:15,512 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:38:15,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:38:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-01-16 18:38:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:38:15,532 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:15,532 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:38:15,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:38:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:15,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:15,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:15,533 INFO L426 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1786071075, now seen corresponding path program 783 times [2020-01-16 18:38:15,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:15,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856980946] [2020-01-16 18:38:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856980946] [2020-01-16 18:38:15,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:15,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280083763] [2020-01-16 18:38:15,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:15,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:15,896 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:16,027 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-01-16 18:38:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:16,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:16,030 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:38:16,031 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:38:16,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:38:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-01-16 18:38:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3118 transitions. [2020-01-16 18:38:16,050 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3118 transitions. Word has length 25 [2020-01-16 18:38:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:16,050 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3118 transitions. [2020-01-16 18:38:16,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3118 transitions. [2020-01-16 18:38:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:16,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:16,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:16,052 INFO L426 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -784310149, now seen corresponding path program 784 times [2020-01-16 18:38:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478509643] [2020-01-16 18:38:16,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:16,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478509643] [2020-01-16 18:38:16,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:16,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:16,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120262363] [2020-01-16 18:38:16,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:16,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:16,420 INFO L87 Difference]: Start difference. First operand 784 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:38:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:16,577 INFO L93 Difference]: Finished difference Result 1260 states and 4432 transitions. [2020-01-16 18:38:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:16,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:16,580 INFO L225 Difference]: With dead ends: 1260 [2020-01-16 18:38:16,580 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:38:16,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:38:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:38:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3107 transitions. [2020-01-16 18:38:16,601 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3107 transitions. Word has length 25 [2020-01-16 18:38:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:16,601 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3107 transitions. [2020-01-16 18:38:16,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3107 transitions. [2020-01-16 18:38:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:16,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:16,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:16,603 INFO L426 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1731029697, now seen corresponding path program 785 times [2020-01-16 18:38:16,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:16,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84660476] [2020-01-16 18:38:16,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84660476] [2020-01-16 18:38:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:16,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199353843] [2020-01-16 18:38:16,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:16,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:16,980 INFO L87 Difference]: Start difference. First operand 780 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:38:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:17,132 INFO L93 Difference]: Finished difference Result 1266 states and 4445 transitions. [2020-01-16 18:38:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:17,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:17,135 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:38:17,135 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:38:17,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:38:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 785. [2020-01-16 18:38:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:38:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3116 transitions. [2020-01-16 18:38:17,155 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:17,155 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3116 transitions. [2020-01-16 18:38:17,155 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3116 transitions. [2020-01-16 18:38:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:17,156 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:17,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:17,157 INFO L426 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -120088739, now seen corresponding path program 786 times [2020-01-16 18:38:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142120931] [2020-01-16 18:38:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142120931] [2020-01-16 18:38:17,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:17,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:17,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836008348] [2020-01-16 18:38:17,527 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:17,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:17,528 INFO L87 Difference]: Start difference. First operand 785 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:17,683 INFO L93 Difference]: Finished difference Result 1264 states and 4436 transitions. [2020-01-16 18:38:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:17,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:17,686 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:38:17,686 INFO L226 Difference]: Without dead ends: 1241 [2020-01-16 18:38:17,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-01-16 18:38:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 776. [2020-01-16 18:38:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:38:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:38:17,706 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:38:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:17,706 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:38:17,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:38:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:17,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:17,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:17,707 INFO L426 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:17,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash 252299771, now seen corresponding path program 787 times [2020-01-16 18:38:17,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:17,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893018677] [2020-01-16 18:38:17,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:18,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893018677] [2020-01-16 18:38:18,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:18,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:18,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579755421] [2020-01-16 18:38:18,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:18,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:18,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:18,080 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:38:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:18,230 INFO L93 Difference]: Finished difference Result 1273 states and 4469 transitions. [2020-01-16 18:38:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:18,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:18,233 INFO L225 Difference]: With dead ends: 1273 [2020-01-16 18:38:18,233 INFO L226 Difference]: Without dead ends: 1258 [2020-01-16 18:38:18,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2020-01-16 18:38:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 787. [2020-01-16 18:38:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:38:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3126 transitions. [2020-01-16 18:38:18,255 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3126 transitions. Word has length 25 [2020-01-16 18:38:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:18,255 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3126 transitions. [2020-01-16 18:38:18,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3126 transitions. [2020-01-16 18:38:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:18,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:18,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:18,256 INFO L426 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -820785609, now seen corresponding path program 788 times [2020-01-16 18:38:18,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:18,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291582971] [2020-01-16 18:38:18,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:18,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-01-16 18:38:18,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291582971] [2020-01-16 18:38:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:18,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:18,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695178839] [2020-01-16 18:38:18,637 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:18,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:18,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:18,637 INFO L87 Difference]: Start difference. First operand 787 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:38:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:18,769 INFO L93 Difference]: Finished difference Result 1274 states and 4465 transitions. [2020-01-16 18:38:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:18,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:18,772 INFO L225 Difference]: With dead ends: 1274 [2020-01-16 18:38:18,773 INFO L226 Difference]: Without dead ends: 1252 [2020-01-16 18:38:18,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-01-16 18:38:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 781. [2020-01-16 18:38:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:38:18,793 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:18,793 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:38:18,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:38:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:18,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:18,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:18,794 INFO L426 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1348138083, now seen corresponding path program 789 times [2020-01-16 18:38:18,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285627377] [2020-01-16 18:38:18,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:19,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285627377] [2020-01-16 18:38:19,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:19,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:19,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027032259] [2020-01-16 18:38:19,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:19,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:19,167 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:19,299 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-01-16 18:38:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:19,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:19,303 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:38:19,303 INFO L226 Difference]: Without dead ends: 1255 [2020-01-16 18:38:19,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-01-16 18:38:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 786. [2020-01-16 18:38:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:38:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3119 transitions. [2020-01-16 18:38:19,323 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3119 transitions. Word has length 25 [2020-01-16 18:38:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:19,323 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3119 transitions. [2020-01-16 18:38:19,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3119 transitions. [2020-01-16 18:38:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:19,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:19,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:19,325 INFO L426 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash -810282505, now seen corresponding path program 790 times [2020-01-16 18:38:19,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:19,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602817470] [2020-01-16 18:38:19,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:19,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602817470] [2020-01-16 18:38:19,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:19,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:19,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891494117] [2020-01-16 18:38:19,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:19,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:19,705 INFO L87 Difference]: Start difference. First operand 786 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:38:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:19,851 INFO L93 Difference]: Finished difference Result 1269 states and 4450 transitions. [2020-01-16 18:38:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:19,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:19,855 INFO L225 Difference]: With dead ends: 1269 [2020-01-16 18:38:19,855 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:38:19,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:38:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 781. [2020-01-16 18:38:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3105 transitions. [2020-01-16 18:38:19,876 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:19,876 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3105 transitions. [2020-01-16 18:38:19,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3105 transitions. [2020-01-16 18:38:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:19,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:19,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] [2020-01-16 18:38:19,877 INFO L426 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1327131875, now seen corresponding path program 791 times [2020-01-16 18:38:19,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:19,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773552791] [2020-01-16 18:38:19,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773552791] [2020-01-16 18:38:20,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:20,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:20,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190465113] [2020-01-16 18:38:20,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:20,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:20,255 INFO L87 Difference]: Start difference. First operand 781 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:20,383 INFO L93 Difference]: Finished difference Result 1272 states and 4456 transitions. [2020-01-16 18:38:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:20,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:20,387 INFO L225 Difference]: With dead ends: 1272 [2020-01-16 18:38:20,387 INFO L226 Difference]: Without dead ends: 1256 [2020-01-16 18:38:20,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2020-01-16 18:38:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 786. [2020-01-16 18:38:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:38:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3114 transitions. [2020-01-16 18:38:20,408 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3114 transitions. Word has length 25 [2020-01-16 18:38:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:20,408 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3114 transitions. [2020-01-16 18:38:20,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3114 transitions. [2020-01-16 18:38:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:20,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:20,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:20,410 INFO L426 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 283809083, now seen corresponding path program 792 times [2020-01-16 18:38:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234511216] [2020-01-16 18:38:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:20,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234511216] [2020-01-16 18:38:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:20,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295857794] [2020-01-16 18:38:20,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:20,781 INFO L87 Difference]: Start difference. First operand 786 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:38:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:20,936 INFO L93 Difference]: Finished difference Result 1270 states and 4447 transitions. [2020-01-16 18:38:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:20,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:20,939 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:38:20,939 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:38:20,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:38:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 772. [2020-01-16 18:38:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:38:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3086 transitions. [2020-01-16 18:38:20,960 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3086 transitions. Word has length 25 [2020-01-16 18:38:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:20,960 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3086 transitions. [2020-01-16 18:38:20,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3086 transitions. [2020-01-16 18:38:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:20,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:20,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:20,962 INFO L426 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash -710356101, now seen corresponding path program 793 times [2020-01-16 18:38:20,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:20,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001591411] [2020-01-16 18:38:20,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:21,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001591411] [2020-01-16 18:38:21,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:21,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:21,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011473563] [2020-01-16 18:38:21,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:21,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:21,328 INFO L87 Difference]: Start difference. First operand 772 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:38:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:21,463 INFO L93 Difference]: Finished difference Result 1236 states and 4374 transitions. [2020-01-16 18:38:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:21,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:21,467 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:38:21,467 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:38:21,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:38:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-01-16 18:38:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:38:21,489 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:21,489 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:38:21,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:38:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:21,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:21,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:21,490 INFO L426 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 270398617, now seen corresponding path program 794 times [2020-01-16 18:38:21,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547910057] [2020-01-16 18:38:21,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:21,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547910057] [2020-01-16 18:38:21,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:21,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:21,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871497998] [2020-01-16 18:38:21,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:21,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:21,865 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:22,018 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-01-16 18:38:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:22,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:22,021 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:38:22,021 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:38:22,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:38:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:38:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:38:22,041 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:38:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:22,041 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:38:22,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:38:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:22,042 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:22,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:22,042 INFO L426 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677977, now seen corresponding path program 795 times [2020-01-16 18:38:22,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:22,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470143823] [2020-01-16 18:38:22,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:22,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470143823] [2020-01-16 18:38:22,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:22,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:22,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072402944] [2020-01-16 18:38:22,408 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:22,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:22,409 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:38:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:22,541 INFO L93 Difference]: Finished difference Result 1241 states and 4382 transitions. [2020-01-16 18:38:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:22,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:22,544 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:38:22,544 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:38:22,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:38:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-01-16 18:38:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:38:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-01-16 18:38:22,565 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-01-16 18:38:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:22,565 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-01-16 18:38:22,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-01-16 18:38:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:22,566 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:22,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:22,566 INFO L426 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2088031497, now seen corresponding path program 796 times [2020-01-16 18:38:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:22,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378657916] [2020-01-16 18:38:22,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:22,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378657916] [2020-01-16 18:38:22,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:22,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:22,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177259577] [2020-01-16 18:38:22,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:22,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:22,930 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:38:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:23,060 INFO L93 Difference]: Finished difference Result 1244 states and 4384 transitions. [2020-01-16 18:38:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:23,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:23,063 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:23,063 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:23,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:38:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:23,084 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:23,084 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:23,084 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:23,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:23,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:23,085 INFO L426 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:23,085 INFO L82 PathProgramCache]: Analyzing trace with hash 934620027, now seen corresponding path program 797 times [2020-01-16 18:38:23,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:23,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412728145] [2020-01-16 18:38:23,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:23,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-01-16 18:38:23,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412728145] [2020-01-16 18:38:23,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:23,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:23,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880379332] [2020-01-16 18:38:23,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:23,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:23,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:23,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:23,455 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:23,600 INFO L93 Difference]: Finished difference Result 1238 states and 4372 transitions. [2020-01-16 18:38:23,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:23,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:23,603 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:38:23,603 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:38:23,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:38:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:38:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:38:23,623 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:23,623 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:38:23,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:38:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:23,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:23,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] [2020-01-16 18:38:23,625 INFO L426 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1749406311, now seen corresponding path program 798 times [2020-01-16 18:38:23,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:23,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404310541] [2020-01-16 18:38:23,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:23,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-01-16 18:38:23,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404310541] [2020-01-16 18:38:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054529906] [2020-01-16 18:38:23,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:23,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:23,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:23,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:23,980 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:24,128 INFO L93 Difference]: Finished difference Result 1242 states and 4377 transitions. [2020-01-16 18:38:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:24,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:24,132 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:38:24,132 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:38:24,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:38:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-01-16 18:38:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:38:24,153 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:38:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:24,153 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:38:24,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:38:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:24,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:24,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:24,154 INFO L426 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1132841827, now seen corresponding path program 799 times [2020-01-16 18:38:24,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:24,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968940106] [2020-01-16 18:38:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:24,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968940106] [2020-01-16 18:38:24,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:24,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:24,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954847016] [2020-01-16 18:38:24,529 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:24,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:24,529 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:38:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:24,681 INFO L93 Difference]: Finished difference Result 1234 states and 4367 transitions. [2020-01-16 18:38:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:24,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:24,684 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:38:24,684 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:38:24,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:38:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:38:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:38:24,705 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:38:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:24,705 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:38:24,705 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:38:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:24,706 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:24,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:24,706 INFO L426 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -152087109, now seen corresponding path program 800 times [2020-01-16 18:38:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006021399] [2020-01-16 18:38:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:25,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006021399] [2020-01-16 18:38:25,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:25,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:25,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265971563] [2020-01-16 18:38:25,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:25,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:25,089 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:38:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:25,242 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-01-16 18:38:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:25,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:25,246 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:38:25,246 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:38:25,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:38:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:38:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:25,267 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:25,267 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:25,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:25,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:25,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:25,268 INFO L426 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1575740967, now seen corresponding path program 801 times [2020-01-16 18:38:25,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:25,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193043756] [2020-01-16 18:38:25,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:25,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193043756] [2020-01-16 18:38:25,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:25,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:25,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894707734] [2020-01-16 18:38:25,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:25,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:25,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:25,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:25,640 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:25,786 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-01-16 18:38:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:25,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:25,790 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:38:25,790 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:25,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 782. [2020-01-16 18:38:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:38:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3112 transitions. [2020-01-16 18:38:25,811 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3112 transitions. Word has length 25 [2020-01-16 18:38:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:25,811 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3112 transitions. [2020-01-16 18:38:25,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3112 transitions. [2020-01-16 18:38:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:25,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:25,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:25,812 INFO L426 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -573980041, now seen corresponding path program 802 times [2020-01-16 18:38:25,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:25,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503156633] [2020-01-16 18:38:25,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:26,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503156633] [2020-01-16 18:38:26,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:26,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:26,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597037562] [2020-01-16 18:38:26,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:26,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:26,177 INFO L87 Difference]: Start difference. First operand 782 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:38:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:26,326 INFO L93 Difference]: Finished difference Result 1238 states and 4369 transitions. [2020-01-16 18:38:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:26,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:26,330 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:38:26,330 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:38:26,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:38:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:38:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:38:26,351 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:26,351 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:38:26,351 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:38:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:26,352 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:26,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:26,352 INFO L426 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 837730525, now seen corresponding path program 803 times [2020-01-16 18:38:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157452992] [2020-01-16 18:38:26,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:26,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-01-16 18:38:26,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157452992] [2020-01-16 18:38:26,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:26,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:26,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824371646] [2020-01-16 18:38:26,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:26,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:26,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:26,729 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:26,878 INFO L93 Difference]: Finished difference Result 1234 states and 4361 transitions. [2020-01-16 18:38:26,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:26,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:26,882 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:38:26,882 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:38:26,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:38:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 781. [2020-01-16 18:38:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:38:26,902 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:38:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:26,902 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:38:26,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:38:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:26,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:26,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:26,904 INFO L426 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -235354855, now seen corresponding path program 804 times [2020-01-16 18:38:26,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:26,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412639548] [2020-01-16 18:38:26,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:27,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-01-16 18:38:27,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412639548] [2020-01-16 18:38:27,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:27,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:27,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534217619] [2020-01-16 18:38:27,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:27,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:27,268 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:38:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:27,396 INFO L93 Difference]: Finished difference Result 1236 states and 4362 transitions. [2020-01-16 18:38:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:27,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:27,399 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:38:27,400 INFO L226 Difference]: Without dead ends: 1216 [2020-01-16 18:38:27,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-01-16 18:38:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 775. [2020-01-16 18:38:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:38:27,421 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:38:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:27,421 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:38:27,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:38:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:27,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:27,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:27,423 INFO L426 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 370706525, now seen corresponding path program 805 times [2020-01-16 18:38:27,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:27,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508916549] [2020-01-16 18:38:27,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:27,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-01-16 18:38:27,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508916549] [2020-01-16 18:38:27,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:27,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:27,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38462364] [2020-01-16 18:38:27,791 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:27,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:27,792 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:38:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:27,929 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-01-16 18:38:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:27,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:27,932 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:38:27,932 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:38:27,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:38:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-01-16 18:38:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:38:27,953 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:27,953 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:38:27,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:38:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:27,954 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:27,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:27,954 INFO L426 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1361964347, now seen corresponding path program 806 times [2020-01-16 18:38:27,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:27,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127664672] [2020-01-16 18:38:27,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:28,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127664672] [2020-01-16 18:38:28,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:28,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:28,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175991684] [2020-01-16 18:38:28,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:28,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:28,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:28,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:28,313 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:28,460 INFO L93 Difference]: Finished difference Result 1250 states and 4398 transitions. [2020-01-16 18:38:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:28,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:28,464 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:38:28,464 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:38:28,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:38:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-01-16 18:38:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:38:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:38:28,484 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:28,485 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:38:28,485 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:38:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:28,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:28,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:28,486 INFO L426 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1998226693, now seen corresponding path program 807 times [2020-01-16 18:38:28,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:28,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608266693] [2020-01-16 18:38:28,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:28,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608266693] [2020-01-16 18:38:28,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:28,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:28,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088002363] [2020-01-16 18:38:28,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:28,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:28,849 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:28,992 INFO L93 Difference]: Finished difference Result 1245 states and 4388 transitions. [2020-01-16 18:38:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:28,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:28,996 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:38:28,996 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:38:28,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:38:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:38:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:38:29,017 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:38:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:29,017 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:38:29,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:38:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:29,018 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:29,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:29,018 INFO L426 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -996465767, now seen corresponding path program 808 times [2020-01-16 18:38:29,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:29,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882261041] [2020-01-16 18:38:29,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:29,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-01-16 18:38:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882261041] [2020-01-16 18:38:29,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:29,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:29,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688376261] [2020-01-16 18:38:29,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:29,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:29,389 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:38:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:29,531 INFO L93 Difference]: Finished difference Result 1246 states and 4386 transitions. [2020-01-16 18:38:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:29,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:29,534 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:38:29,534 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:38:29,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:38:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-01-16 18:38:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:38:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-01-16 18:38:29,554 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-01-16 18:38:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:29,554 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-01-16 18:38:29,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-01-16 18:38:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:29,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:29,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] [2020-01-16 18:38:29,555 INFO L426 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1943185315, now seen corresponding path program 809 times [2020-01-16 18:38:29,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:29,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3134372] [2020-01-16 18:38:29,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:29,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3134372] [2020-01-16 18:38:29,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:29,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:29,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477729178] [2020-01-16 18:38:29,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:29,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:29,921 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:38:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:30,064 INFO L93 Difference]: Finished difference Result 1252 states and 4399 transitions. [2020-01-16 18:38:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:30,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:30,067 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:38:30,067 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:38:30,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:38:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 784. [2020-01-16 18:38:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-01-16 18:38:30,088 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:30,088 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-01-16 18:38:30,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-01-16 18:38:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:30,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:30,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:30,090 INFO L426 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -332244357, now seen corresponding path program 810 times [2020-01-16 18:38:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:30,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938035743] [2020-01-16 18:38:30,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:30,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938035743] [2020-01-16 18:38:30,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:30,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:30,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261949763] [2020-01-16 18:38:30,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:30,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:30,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:30,448 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:30,595 INFO L93 Difference]: Finished difference Result 1250 states and 4390 transitions. [2020-01-16 18:38:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:30,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:30,598 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:38:30,598 INFO L226 Difference]: Without dead ends: 1227 [2020-01-16 18:38:30,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-01-16 18:38:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 775. [2020-01-16 18:38:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:38:30,619 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:38:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:30,619 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:38:30,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:38:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:30,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:30,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:30,620 INFO L426 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1554195609, now seen corresponding path program 811 times [2020-01-16 18:38:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242979928] [2020-01-16 18:38:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18: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-01-16 18:38:30,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242979928] [2020-01-16 18:38:30,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:30,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:30,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624555865] [2020-01-16 18:38:30,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:30,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:30,981 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:38:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:31,117 INFO L93 Difference]: Finished difference Result 1240 states and 4374 transitions. [2020-01-16 18:38:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:31,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:31,120 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:38:31,120 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:38:31,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:38:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-01-16 18:38:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:38:31,140 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:38:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:31,140 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:38:31,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:38:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:31,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:31,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:31,142 INFO L426 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1129830729, now seen corresponding path program 812 times [2020-01-16 18:38:31,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:31,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564664562] [2020-01-16 18:38:31,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:31,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-01-16 18:38:31,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564664562] [2020-01-16 18:38:31,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:31,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:31,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232284713] [2020-01-16 18:38:31,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:31,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:31,492 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:38:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:31,648 INFO L93 Difference]: Finished difference Result 1244 states and 4379 transitions. [2020-01-16 18:38:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:31,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:31,651 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:31,652 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:38:31,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:38:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 778. [2020-01-16 18:38:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-01-16 18:38:31,672 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-01-16 18:38:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:31,672 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-01-16 18:38:31,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-01-16 18:38:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:31,673 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:31,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:31,673 INFO L426 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:31,673 INFO L82 PathProgramCache]: Analyzing trace with hash -46242245, now seen corresponding path program 813 times [2020-01-16 18:38:31,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:31,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578622967] [2020-01-16 18:38:31,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:32,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-01-16 18:38:32,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578622967] [2020-01-16 18:38:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:32,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71073478] [2020-01-16 18:38:32,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:32,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:32,024 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:38:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:32,184 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-01-16 18:38:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:32,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:32,188 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:38:32,188 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:38:32,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:38:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:38:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:38:32,221 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:38:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:32,222 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:38:32,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:38:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:32,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:32,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:32,223 INFO L426 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1119327625, now seen corresponding path program 814 times [2020-01-16 18:38:32,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:32,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875790698] [2020-01-16 18:38:32,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:32,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875790698] [2020-01-16 18:38:32,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:32,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:32,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133287703] [2020-01-16 18:38:32,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:32,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:32,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:32,582 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:38:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:32,743 INFO L93 Difference]: Finished difference Result 1240 states and 4368 transitions. [2020-01-16 18:38:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:32,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:32,747 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:38:32,747 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:38:32,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:38:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 778. [2020-01-16 18:38:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:38:32,767 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:38:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:32,767 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:38:32,767 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:38:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:32,768 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:32,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:32,768 INFO L426 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash -35739141, now seen corresponding path program 815 times [2020-01-16 18:38:32,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:32,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215527716] [2020-01-16 18:38:32,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:33,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215527716] [2020-01-16 18:38:33,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:33,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:33,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965397763] [2020-01-16 18:38:33,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:33,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:33,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:33,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:33,129 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:38:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:33,288 INFO L93 Difference]: Finished difference Result 1248 states and 4386 transitions. [2020-01-16 18:38:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:33,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:33,292 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:38:33,292 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:38:33,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:38:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:38:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-01-16 18:38:33,312 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:33,312 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-01-16 18:38:33,312 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-01-16 18:38:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:33,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:33,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:33,313 INFO L426 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1575201817, now seen corresponding path program 816 times [2020-01-16 18:38:33,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:33,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408895489] [2020-01-16 18:38:33,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:33,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408895489] [2020-01-16 18:38:33,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:33,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:33,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821430540] [2020-01-16 18:38:33,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:33,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:33,671 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:33,845 INFO L93 Difference]: Finished difference Result 1246 states and 4377 transitions. [2020-01-16 18:38:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:33,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:33,848 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:38:33,848 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:38:33,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:38:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 772. [2020-01-16 18:38:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:38:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3083 transitions. [2020-01-16 18:38:33,867 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3083 transitions. Word has length 25 [2020-01-16 18:38:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:33,868 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3083 transitions. [2020-01-16 18:38:33,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3083 transitions. [2020-01-16 18:38:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:33,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:33,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:33,869 INFO L426 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1296926015, now seen corresponding path program 817 times [2020-01-16 18:38:33,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:33,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081355109] [2020-01-16 18:38:33,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:34,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081355109] [2020-01-16 18:38:34,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:34,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:34,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938739396] [2020-01-16 18:38:34,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:34,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:34,235 INFO L87 Difference]: Start difference. First operand 772 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:38:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:34,391 INFO L93 Difference]: Finished difference Result 1250 states and 4406 transitions. [2020-01-16 18:38:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:34,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:34,394 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:38:34,394 INFO L226 Difference]: Without dead ends: 1235 [2020-01-16 18:38:34,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2020-01-16 18:38:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 781. [2020-01-16 18:38:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:38:34,415 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:38:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:34,415 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:38:34,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:38:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:34,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:34,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:34,416 INFO L426 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1387100323, now seen corresponding path program 818 times [2020-01-16 18:38:34,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:34,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742381151] [2020-01-16 18:38:34,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:34,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742381151] [2020-01-16 18:38:34,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:34,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:34,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408302051] [2020-01-16 18:38:34,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:34,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:34,782 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:38:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:34,907 INFO L93 Difference]: Finished difference Result 1247 states and 4397 transitions. [2020-01-16 18:38:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:34,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:34,910 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:38:34,910 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:38:34,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:38:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-01-16 18:38:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:34,931 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:34,931 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:34,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:34,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:34,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:34,932 INFO L426 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash -303511839, now seen corresponding path program 819 times [2020-01-16 18:38:34,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:34,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840449196] [2020-01-16 18:38:34,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:35,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840449196] [2020-01-16 18:38:35,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:35,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:35,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629107665] [2020-01-16 18:38:35,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:35,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:35,322 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:35,450 INFO L93 Difference]: Finished difference Result 1257 states and 4420 transitions. [2020-01-16 18:38:35,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:35,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:35,454 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:38:35,454 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:38:35,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:38:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 784. [2020-01-16 18:38:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-01-16 18:38:35,476 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:35,476 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-01-16 18:38:35,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-01-16 18:38:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:35,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:35,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:35,477 INFO L426 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1376597219, now seen corresponding path program 820 times [2020-01-16 18:38:35,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:35,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265363761] [2020-01-16 18:38:35,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:35,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265363761] [2020-01-16 18:38:35,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:35,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:35,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936384632] [2020-01-16 18:38:35,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:35,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:35,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:35,843 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:35,998 INFO L93 Difference]: Finished difference Result 1258 states and 4416 transitions. [2020-01-16 18:38:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:35,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:36,001 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:38:36,001 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:38:36,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:38:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 778. [2020-01-16 18:38:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:38:36,022 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:36,022 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:38:36,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:38:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:36,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:36,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:36,023 INFO L426 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -293008735, now seen corresponding path program 821 times [2020-01-16 18:38:36,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:36,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038768209] [2020-01-16 18:38:36,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:36,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038768209] [2020-01-16 18:38:36,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:36,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:36,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714968223] [2020-01-16 18:38:36,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:36,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:36,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:36,384 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:36,514 INFO L93 Difference]: Finished difference Result 1248 states and 4396 transitions. [2020-01-16 18:38:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:36,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:36,517 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:38:36,517 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:38:36,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:38:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 781. [2020-01-16 18:38:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:38:36,537 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:38:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:36,537 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:38:36,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:38:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:36,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:36,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:36,538 INFO L426 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1317932223, now seen corresponding path program 822 times [2020-01-16 18:38:36,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:36,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888168097] [2020-01-16 18:38:36,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:36,916 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:38:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:36,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888168097] [2020-01-16 18:38:36,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:36,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:36,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001989583] [2020-01-16 18:38:36,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:36,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:36,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:36,921 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:38:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:37,074 INFO L93 Difference]: Finished difference Result 1252 states and 4401 transitions. [2020-01-16 18:38:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:37,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:37,077 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:38:37,077 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:38:37,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:38:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 775. [2020-01-16 18:38:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:38:37,097 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:38:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:37,097 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:38:37,097 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:38:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:37,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:37,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:37,099 INFO L426 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1072007203, now seen corresponding path program 823 times [2020-01-16 18:38:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:37,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98712798] [2020-01-16 18:38:37,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:37,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98712798] [2020-01-16 18:38:37,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:37,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:37,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797352857] [2020-01-16 18:38:37,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:37,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:37,462 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:38:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:37,597 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-01-16 18:38:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:37,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:37,600 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:38:37,600 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:38:37,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:38:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:38:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:38:37,620 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:37,620 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:38:37,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:38:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:37,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:37,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:37,622 INFO L426 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash 538933755, now seen corresponding path program 824 times [2020-01-16 18:38:37,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:37,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315800932] [2020-01-16 18:38:37,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:37,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315800932] [2020-01-16 18:38:37,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:37,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:37,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898578109] [2020-01-16 18:38:37,983 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:37,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:37,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:37,984 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:38,129 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:38:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:38,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:38,133 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:38,133 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:38:38,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:38:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-01-16 18:38:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:38:38,153 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:38,153 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:38:38,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:38:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:38,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:38,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:38,155 INFO L426 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash 22084385, now seen corresponding path program 825 times [2020-01-16 18:38:38,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:38,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23358113] [2020-01-16 18:38:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:38,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23358113] [2020-01-16 18:38:38,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:38,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:38,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227275495] [2020-01-16 18:38:38,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:38,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:38,523 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:38,672 INFO L93 Difference]: Finished difference Result 1251 states and 4403 transitions. [2020-01-16 18:38:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:38,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:38,676 INFO L225 Difference]: With dead ends: 1251 [2020-01-16 18:38:38,676 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:38:38,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:38:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 783. [2020-01-16 18:38:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-01-16 18:38:38,696 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:38,696 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-01-16 18:38:38,696 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-01-16 18:38:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:38,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:38,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:38,697 INFO L426 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 559939963, now seen corresponding path program 826 times [2020-01-16 18:38:38,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:38,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289377959] [2020-01-16 18:38:38,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:39,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-01-16 18:38:39,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289377959] [2020-01-16 18:38:39,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:39,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:39,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826018073] [2020-01-16 18:38:39,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:39,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:39,077 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:39,207 INFO L93 Difference]: Finished difference Result 1250 states and 4396 transitions. [2020-01-16 18:38:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:39,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:39,210 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:38:39,210 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:38:39,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:38:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-01-16 18:38:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-01-16 18:38:39,230 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-01-16 18:38:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:39,230 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-01-16 18:38:39,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-01-16 18:38:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:39,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:39,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:39,231 INFO L426 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:39,231 INFO L82 PathProgramCache]: Analyzing trace with hash 32587489, now seen corresponding path program 827 times [2020-01-16 18:38:39,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:39,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15881717] [2020-01-16 18:38:39,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:39,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15881717] [2020-01-16 18:38:39,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:39,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:39,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362512353] [2020-01-16 18:38:39,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:39,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:39,588 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:38:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:39,722 INFO L93 Difference]: Finished difference Result 1243 states and 4382 transitions. [2020-01-16 18:38:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:39,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:39,725 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:38:39,725 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:38:39,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:38:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-01-16 18:38:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:38:39,745 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:38:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:39,746 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:38:39,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:38:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:39,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:39,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:39,747 INFO L426 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1040497891, now seen corresponding path program 828 times [2020-01-16 18:38:39,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:39,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724137395] [2020-01-16 18:38:39,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:40,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724137395] [2020-01-16 18:38:40,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:40,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:40,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908606937] [2020-01-16 18:38:40,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:40,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:40,116 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:38:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:40,252 INFO L93 Difference]: Finished difference Result 1245 states and 4383 transitions. [2020-01-16 18:38:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:40,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:40,273 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:38:40,273 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:38:40,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:38:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-01-16 18:38:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:38:40,292 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:38:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:40,292 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:38:40,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:38:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:40,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:40,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:40,293 INFO L426 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash -746410979, now seen corresponding path program 829 times [2020-01-16 18:38:40,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:40,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821195934] [2020-01-16 18:38:40,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:40,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821195934] [2020-01-16 18:38:40,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:40,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:40,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818092612] [2020-01-16 18:38:40,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:40,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:40,666 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:38:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:40,844 INFO L93 Difference]: Finished difference Result 1265 states and 4441 transitions. [2020-01-16 18:38:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:40,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:40,847 INFO L225 Difference]: With dead ends: 1265 [2020-01-16 18:38:40,847 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:38:40,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:38:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 786. [2020-01-16 18:38:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:38:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3121 transitions. [2020-01-16 18:38:40,867 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3121 transitions. Word has length 25 [2020-01-16 18:38:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:40,867 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3121 transitions. [2020-01-16 18:38:40,867 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3121 transitions. [2020-01-16 18:38:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:40,868 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:40,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:40,868 INFO L426 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1819496359, now seen corresponding path program 830 times [2020-01-16 18:38:40,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:40,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195059914] [2020-01-16 18:38:40,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:41,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195059914] [2020-01-16 18:38:41,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:41,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:41,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247241791] [2020-01-16 18:38:41,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:41,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:41,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:41,257 INFO L87 Difference]: Start difference. First operand 786 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:38:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:41,433 INFO L93 Difference]: Finished difference Result 1266 states and 4437 transitions. [2020-01-16 18:38:41,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:41,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:41,437 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:38:41,437 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:38:41,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:38:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-01-16 18:38:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:38:41,458 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:41,458 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:38:41,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:38:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:41,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:41,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:41,459 INFO L426 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1948118463, now seen corresponding path program 831 times [2020-01-16 18:38:41,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:41,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436262779] [2020-01-16 18:38:41,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:41,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436262779] [2020-01-16 18:38:41,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:41,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:41,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067435927] [2020-01-16 18:38:41,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:41,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:41,825 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:41,961 INFO L93 Difference]: Finished difference Result 1262 states and 4429 transitions. [2020-01-16 18:38:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:41,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:41,964 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:38:41,964 INFO L226 Difference]: Without dead ends: 1247 [2020-01-16 18:38:41,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-01-16 18:38:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 785. [2020-01-16 18:38:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:38:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3114 transitions. [2020-01-16 18:38:41,985 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3114 transitions. Word has length 25 [2020-01-16 18:38:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:41,985 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3114 transitions. [2020-01-16 18:38:41,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3114 transitions. [2020-01-16 18:38:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:41,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:41,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:41,987 INFO L426 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1808993255, now seen corresponding path program 832 times [2020-01-16 18:38:41,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:41,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988562552] [2020-01-16 18:38:41,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:42,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988562552] [2020-01-16 18:38:42,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:42,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:42,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063322023] [2020-01-16 18:38:42,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:42,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:42,379 INFO L87 Difference]: Start difference. First operand 785 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:38:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:42,560 INFO L93 Difference]: Finished difference Result 1261 states and 4422 transitions. [2020-01-16 18:38:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:42,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:42,564 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:38:42,564 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:38:42,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:38:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:38:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:38:42,584 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:38:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:42,584 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:38:42,584 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:38:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:42,585 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:42,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:42,585 INFO L426 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1969124671, now seen corresponding path program 833 times [2020-01-16 18:38:42,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:42,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164859516] [2020-01-16 18:38:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:42,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164859516] [2020-01-16 18:38:42,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:42,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:42,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857985937] [2020-01-16 18:38:42,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:42,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:42,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:42,955 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:38:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:43,109 INFO L93 Difference]: Finished difference Result 1264 states and 4428 transitions. [2020-01-16 18:38:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:43,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:43,112 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:38:43,112 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:38:43,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:38:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-01-16 18:38:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:38:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3109 transitions. [2020-01-16 18:38:43,132 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3109 transitions. Word has length 25 [2020-01-16 18:38:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:43,132 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3109 transitions. [2020-01-16 18:38:43,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3109 transitions. [2020-01-16 18:38:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:43,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:43,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:43,133 INFO L426 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash -714901667, now seen corresponding path program 834 times [2020-01-16 18:38:43,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:43,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166321615] [2020-01-16 18:38:43,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:43,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166321615] [2020-01-16 18:38:43,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:43,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:43,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572148886] [2020-01-16 18:38:43,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:43,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:43,495 INFO L87 Difference]: Start difference. First operand 785 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:38:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:43,675 INFO L93 Difference]: Finished difference Result 1262 states and 4419 transitions. [2020-01-16 18:38:43,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:43,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:43,679 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:38:43,679 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:38:43,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:38:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 775. [2020-01-16 18:38:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:38:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3088 transitions. [2020-01-16 18:38:43,700 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3088 transitions. Word has length 25 [2020-01-16 18:38:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:43,700 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3088 transitions. [2020-01-16 18:38:43,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3088 transitions. [2020-01-16 18:38:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:43,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:43,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:43,701 INFO L426 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1190126203, now seen corresponding path program 835 times [2020-01-16 18:38:43,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:43,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594627698] [2020-01-16 18:38:43,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:44,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594627698] [2020-01-16 18:38:44,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:44,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:44,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395237385] [2020-01-16 18:38:44,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:44,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:44,071 INFO L87 Difference]: Start difference. First operand 775 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:38:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:44,245 INFO L93 Difference]: Finished difference Result 1246 states and 4388 transitions. [2020-01-16 18:38:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:44,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:44,249 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:38:44,249 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:38:44,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:38:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 781. [2020-01-16 18:38:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:38:44,270 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:38:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:44,270 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:38:44,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:38:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:44,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:44,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:44,271 INFO L426 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1493900135, now seen corresponding path program 836 times [2020-01-16 18:38:44,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:44,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115902624] [2020-01-16 18:38:44,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115902624] [2020-01-16 18:38:44,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:44,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:44,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282198336] [2020-01-16 18:38:44,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:44,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:44,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:44,615 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:38:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:44,790 INFO L93 Difference]: Finished difference Result 1250 states and 4393 transitions. [2020-01-16 18:38:44,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:44,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:44,793 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:38:44,793 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:38:44,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:38:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-01-16 18:38:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:38:44,814 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:38:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:44,814 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:38:44,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:38:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:44,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:44,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:44,816 INFO L426 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -410311651, now seen corresponding path program 837 times [2020-01-16 18:38:44,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:44,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875939074] [2020-01-16 18:38:44,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:45,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875939074] [2020-01-16 18:38:45,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:45,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:45,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019067640] [2020-01-16 18:38:45,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:45,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:45,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:45,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:45,192 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:38:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:45,368 INFO L93 Difference]: Finished difference Result 1244 states and 4381 transitions. [2020-01-16 18:38:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:45,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:45,372 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:38:45,372 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:38:45,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:38:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:38:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-01-16 18:38:45,392 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-01-16 18:38:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:45,392 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-01-16 18:38:45,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-01-16 18:38:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:45,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:45,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:45,393 INFO L426 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1483397031, now seen corresponding path program 838 times [2020-01-16 18:38:45,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:45,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790910011] [2020-01-16 18:38:45,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:45,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-01-16 18:38:45,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790910011] [2020-01-16 18:38:45,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:45,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:45,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24768548] [2020-01-16 18:38:45,748 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:45,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:45,748 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:38:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:45,940 INFO L93 Difference]: Finished difference Result 1246 states and 4382 transitions. [2020-01-16 18:38:45,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:45,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:45,944 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:38:45,944 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:38:45,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:38:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-01-16 18:38:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-01-16 18:38:45,964 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-01-16 18:38:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:45,965 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-01-16 18:38:45,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-01-16 18:38:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:45,966 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:45,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:45,966 INFO L426 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash -399808547, now seen corresponding path program 839 times [2020-01-16 18:38:45,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:45,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705300944] [2020-01-16 18:38:45,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:46,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705300944] [2020-01-16 18:38:46,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:46,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:46,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009974639] [2020-01-16 18:38:46,324 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:46,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:46,324 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:38:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:46,504 INFO L93 Difference]: Finished difference Result 1254 states and 4400 transitions. [2020-01-16 18:38:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:46,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:46,508 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:38:46,508 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:38:46,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:38:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-01-16 18:38:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-01-16 18:38:46,529 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:46,529 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-01-16 18:38:46,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-01-16 18:38:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:46,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:46,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:46,531 INFO L426 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1211132411, now seen corresponding path program 840 times [2020-01-16 18:38:46,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:46,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045640418] [2020-01-16 18:38:46,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:46,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045640418] [2020-01-16 18:38:46,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:46,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:46,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138190243] [2020-01-16 18:38:46,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:46,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:46,887 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:47,071 INFO L93 Difference]: Finished difference Result 1252 states and 4391 transitions. [2020-01-16 18:38:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:47,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:47,075 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:38:47,075 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:38:47,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:38:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 769. [2020-01-16 18:38:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:38:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3076 transitions. [2020-01-16 18:38:47,095 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3076 transitions. Word has length 25 [2020-01-16 18:38:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:47,095 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3076 transitions. [2020-01-16 18:38:47,095 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3076 transitions. [2020-01-16 18:38:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:47,096 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:47,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:47,096 INFO L426 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1423698301, now seen corresponding path program 841 times [2020-01-16 18:38:47,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:47,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973662115] [2020-01-16 18:38:47,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:47,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973662115] [2020-01-16 18:38:47,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:47,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243502448] [2020-01-16 18:38:47,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:47,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:47,442 INFO L87 Difference]: Start difference. First operand 769 states and 3076 transitions. Second operand 10 states. [2020-01-16 18:38:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:47,625 INFO L93 Difference]: Finished difference Result 1213 states and 4289 transitions. [2020-01-16 18:38:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:47,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:47,628 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:38:47,628 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:38:47,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:38:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 781. [2020-01-16 18:38:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:38:47,648 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:38:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:47,648 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:38:47,648 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:38:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:47,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:47,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:47,649 INFO L426 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash -453446687, now seen corresponding path program 842 times [2020-01-16 18:38:47,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:47,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867805385] [2020-01-16 18:38:47,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:48,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867805385] [2020-01-16 18:38:48,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:48,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:48,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148156559] [2020-01-16 18:38:48,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:48,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:48,015 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:38:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:48,162 INFO L93 Difference]: Finished difference Result 1215 states and 4289 transitions. [2020-01-16 18:38:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:48,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:48,165 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:38:48,165 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:38:48,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:38:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:38:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3109 transitions. [2020-01-16 18:38:48,185 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3109 transitions. Word has length 25 [2020-01-16 18:38:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:48,186 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3109 transitions. [2020-01-16 18:38:48,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3109 transitions. [2020-01-16 18:38:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:48,187 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:48,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:48,187 INFO L426 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 502335777, now seen corresponding path program 843 times [2020-01-16 18:38:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:48,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427108234] [2020-01-16 18:38:48,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:48,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427108234] [2020-01-16 18:38:48,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:48,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:48,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805320334] [2020-01-16 18:38:48,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:48,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:48,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:48,543 INFO L87 Difference]: Start difference. First operand 777 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:38:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:48,728 INFO L93 Difference]: Finished difference Result 1209 states and 4277 transitions. [2020-01-16 18:38:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:48,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:48,731 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:38:48,731 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:38:48,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:38:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-01-16 18:38:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3114 transitions. [2020-01-16 18:38:48,751 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3114 transitions. Word has length 25 [2020-01-16 18:38:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:48,751 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3114 transitions. [2020-01-16 18:38:48,751 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3114 transitions. [2020-01-16 18:38:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:48,752 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:48,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:48,752 INFO L426 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1483090495, now seen corresponding path program 844 times [2020-01-16 18:38:48,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:48,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021665875] [2020-01-16 18:38:48,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:49,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-01-16 18:38:49,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021665875] [2020-01-16 18:38:49,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:49,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:49,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385466348] [2020-01-16 18:38:49,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:49,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:49,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:49,105 INFO L87 Difference]: Start difference. First operand 780 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:38:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:49,287 INFO L93 Difference]: Finished difference Result 1208 states and 4272 transitions. [2020-01-16 18:38:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:49,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:49,290 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:38:49,290 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:38:49,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:38:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:38:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3106 transitions. [2020-01-16 18:38:49,310 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3106 transitions. Word has length 25 [2020-01-16 18:38:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:49,310 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3106 transitions. [2020-01-16 18:38:49,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3106 transitions. [2020-01-16 18:38:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:49,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:49,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:49,311 INFO L426 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -114821501, now seen corresponding path program 845 times [2020-01-16 18:38:49,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:49,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997518885] [2020-01-16 18:38:49,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:49,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997518885] [2020-01-16 18:38:49,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:49,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:49,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363450107] [2020-01-16 18:38:49,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:49,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:49,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:49,663 INFO L87 Difference]: Start difference. First operand 777 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:38:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:49,809 INFO L93 Difference]: Finished difference Result 1213 states and 4282 transitions. [2020-01-16 18:38:49,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:49,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:49,812 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:38:49,813 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:38:49,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:38:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-01-16 18:38:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:38:49,848 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:49,848 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:38:49,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:38:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:49,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:49,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:49,849 INFO L426 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1496119457, now seen corresponding path program 846 times [2020-01-16 18:38:49,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:49,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194282354] [2020-01-16 18:38:49,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:50,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194282354] [2020-01-16 18:38:50,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:50,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:50,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561916284] [2020-01-16 18:38:50,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:50,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:50,201 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:50,348 INFO L93 Difference]: Finished difference Result 1210 states and 4273 transitions. [2020-01-16 18:38:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:50,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:50,351 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:38:50,351 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:38:50,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:38:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 774. [2020-01-16 18:38:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:38:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3098 transitions. [2020-01-16 18:38:50,371 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3098 transitions. Word has length 25 [2020-01-16 18:38:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:50,371 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3098 transitions. [2020-01-16 18:38:50,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3098 transitions. [2020-01-16 18:38:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:50,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:50,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:50,372 INFO L426 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1846184027, now seen corresponding path program 847 times [2020-01-16 18:38:50,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:50,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221283694] [2020-01-16 18:38:50,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:50,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-01-16 18:38:50,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221283694] [2020-01-16 18:38:50,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:50,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:50,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902374155] [2020-01-16 18:38:50,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:50,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:50,721 INFO L87 Difference]: Start difference. First operand 774 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:38:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:50,867 INFO L93 Difference]: Finished difference Result 1222 states and 4310 transitions. [2020-01-16 18:38:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:50,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:50,870 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:38:50,870 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:38:50,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:38:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-01-16 18:38:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:38:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3120 transitions. [2020-01-16 18:38:50,891 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3120 transitions. Word has length 25 [2020-01-16 18:38:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:50,891 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3120 transitions. [2020-01-16 18:38:50,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3120 transitions. [2020-01-16 18:38:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:50,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:50,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:50,892 INFO L426 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash -875932413, now seen corresponding path program 848 times [2020-01-16 18:38:50,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:50,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683984954] [2020-01-16 18:38:50,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:51,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683984954] [2020-01-16 18:38:51,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:51,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:51,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286281209] [2020-01-16 18:38:51,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:51,239 INFO L87 Difference]: Start difference. First operand 782 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:38:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:51,383 INFO L93 Difference]: Finished difference Result 1224 states and 4310 transitions. [2020-01-16 18:38:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:51,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:51,386 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:38:51,386 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:38:51,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:38:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 778. [2020-01-16 18:38:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3109 transitions. [2020-01-16 18:38:51,406 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3109 transitions. Word has length 25 [2020-01-16 18:38:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:51,406 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3109 transitions. [2020-01-16 18:38:51,406 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3109 transitions. [2020-01-16 18:38:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:51,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:51,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:51,407 INFO L426 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2005884129, now seen corresponding path program 849 times [2020-01-16 18:38:51,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490537574] [2020-01-16 18:38:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:51,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490537574] [2020-01-16 18:38:51,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:51,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:51,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019170218] [2020-01-16 18:38:51,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:51,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:51,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:51,762 INFO L87 Difference]: Start difference. First operand 778 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:38:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:51,956 INFO L93 Difference]: Finished difference Result 1223 states and 4308 transitions. [2020-01-16 18:38:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:51,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:51,959 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:38:51,959 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:38:51,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:38:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 782. [2020-01-16 18:38:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:38:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3116 transitions. [2020-01-16 18:38:51,979 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:51,979 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3116 transitions. [2020-01-16 18:38:51,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3116 transitions. [2020-01-16 18:38:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:51,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:51,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:51,980 INFO L426 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825345, now seen corresponding path program 850 times [2020-01-16 18:38:51,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:51,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436465900] [2020-01-16 18:38:51,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:52,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436465900] [2020-01-16 18:38:52,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:52,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:52,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63095377] [2020-01-16 18:38:52,331 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:52,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:52,332 INFO L87 Difference]: Start difference. First operand 782 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:52,518 INFO L93 Difference]: Finished difference Result 1226 states and 4310 transitions. [2020-01-16 18:38:52,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:52,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:52,521 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:38:52,521 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:38:52,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:38:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 778. [2020-01-16 18:38:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:38:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:38:52,541 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:52,541 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:38:52,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:38:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:52,542 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:52,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:52,543 INFO L426 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -211711003, now seen corresponding path program 851 times [2020-01-16 18:38:52,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:52,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19510886] [2020-01-16 18:38:52,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:52,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-01-16 18:38:52,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19510886] [2020-01-16 18:38:52,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:52,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:52,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282955715] [2020-01-16 18:38:52,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:52,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:52,896 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:53,035 INFO L93 Difference]: Finished difference Result 1229 states and 4318 transitions. [2020-01-16 18:38:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:53,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:53,038 INFO L225 Difference]: With dead ends: 1229 [2020-01-16 18:38:53,038 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:38:53,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:38:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 784. [2020-01-16 18:38:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:38:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-01-16 18:38:53,058 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-01-16 18:38:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:53,058 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-01-16 18:38:53,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-01-16 18:38:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:53,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:53,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:53,059 INFO L426 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1284796383, now seen corresponding path program 852 times [2020-01-16 18:38:53,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:53,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210439160] [2020-01-16 18:38:53,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:53,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210439160] [2020-01-16 18:38:53,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:53,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:53,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724395587] [2020-01-16 18:38:53,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:53,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:53,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:53,411 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:38:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:53,540 INFO L93 Difference]: Finished difference Result 1230 states and 4314 transitions. [2020-01-16 18:38:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:53,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:53,544 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:38:53,544 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:38:53,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:38:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 774. [2020-01-16 18:38:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:38:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3095 transitions. [2020-01-16 18:38:53,564 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3095 transitions. Word has length 25 [2020-01-16 18:38:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:53,564 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3095 transitions. [2020-01-16 18:38:53,564 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3095 transitions. [2020-01-16 18:38:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:53,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:53,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:53,565 INFO L426 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -342635675, now seen corresponding path program 853 times [2020-01-16 18:38:53,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:53,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777766773] [2020-01-16 18:38:53,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:53,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-01-16 18:38:53,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777766773] [2020-01-16 18:38:53,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:53,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:53,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698433630] [2020-01-16 18:38:53,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:53,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:53,915 INFO L87 Difference]: Start difference. First operand 774 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:38:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:54,062 INFO L93 Difference]: Finished difference Result 1210 states and 4276 transitions. [2020-01-16 18:38:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:54,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:54,065 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:38:54,065 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:38:54,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:38:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 780. [2020-01-16 18:38:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:38:54,084 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:54,085 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:38:54,085 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:38:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:54,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:54,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:54,086 INFO L426 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash 638119043, now seen corresponding path program 854 times [2020-01-16 18:38:54,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:54,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726946672] [2020-01-16 18:38:54,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:54,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726946672] [2020-01-16 18:38:54,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:54,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080437732] [2020-01-16 18:38:54,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:54,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:54,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:54,443 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:54,591 INFO L93 Difference]: Finished difference Result 1209 states and 4271 transitions. [2020-01-16 18:38:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:54,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:54,594 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:38:54,594 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:38:54,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:38:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:38:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-01-16 18:38:54,613 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-01-16 18:38:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:54,613 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-01-16 18:38:54,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-01-16 18:38:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:54,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:54,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:54,615 INFO L426 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1583398403, now seen corresponding path program 855 times [2020-01-16 18:38:54,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:54,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530215426] [2020-01-16 18:38:54,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:54,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530215426] [2020-01-16 18:38:54,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:54,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:54,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407473702] [2020-01-16 18:38:54,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:54,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:54,964 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:38:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:55,084 INFO L93 Difference]: Finished difference Result 1215 states and 4284 transitions. [2020-01-16 18:38:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:55,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:55,087 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:38:55,087 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:38:55,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:38:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-01-16 18:38:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:38:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:38:55,107 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:38:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:55,107 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:38:55,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:38:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:55,109 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:55,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:55,109 INFO L426 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1720311071, now seen corresponding path program 856 times [2020-01-16 18:38:55,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:55,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791238828] [2020-01-16 18:38:55,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:55,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791238828] [2020-01-16 18:38:55,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:55,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:55,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752466082] [2020-01-16 18:38:55,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:55,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:55,463 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:38:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:55,591 INFO L93 Difference]: Finished difference Result 1218 states and 4286 transitions. [2020-01-16 18:38:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:55,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:55,594 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:38:55,594 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:38:55,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:38:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:38:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:38:55,614 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:38:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:55,614 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:38:55,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:38:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:55,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:55,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:55,615 INFO L426 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1302340453, now seen corresponding path program 857 times [2020-01-16 18:38:55,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:55,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842775872] [2020-01-16 18:38:55,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:55,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-01-16 18:38:55,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842775872] [2020-01-16 18:38:55,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:55,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:55,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103651062] [2020-01-16 18:38:55,969 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:55,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:55,970 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:38:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:56,096 INFO L93 Difference]: Finished difference Result 1212 states and 4274 transitions. [2020-01-16 18:38:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:56,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:56,100 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:38:56,100 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:38:56,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:38:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 780. [2020-01-16 18:38:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:38:56,120 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:38:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:56,120 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:38:56,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:38:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:56,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:56,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:56,137 INFO L426 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1381685885, now seen corresponding path program 858 times [2020-01-16 18:38:56,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:56,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227869394] [2020-01-16 18:38:56,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:56,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-01-16 18:38:56,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227869394] [2020-01-16 18:38:56,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:56,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:56,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497627379] [2020-01-16 18:38:56,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:56,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:56,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:56,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:56,481 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:38:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:56,611 INFO L93 Difference]: Finished difference Result 1216 states and 4279 transitions. [2020-01-16 18:38:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:56,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:56,614 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:38:56,614 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:38:56,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:38:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 774. [2020-01-16 18:38:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:38:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-01-16 18:38:56,634 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-01-16 18:38:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:56,634 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-01-16 18:38:56,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-01-16 18:38:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:56,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:56,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:56,635 INFO L426 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash -998794271, now seen corresponding path program 859 times [2020-01-16 18:38:56,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:56,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132448688] [2020-01-16 18:38:56,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:56,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-01-16 18:38:56,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132448688] [2020-01-16 18:38:56,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:56,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:56,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847153128] [2020-01-16 18:38:56,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:56,990 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:38:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:57,114 INFO L93 Difference]: Finished difference Result 1218 states and 4291 transitions. [2020-01-16 18:38:57,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:57,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:57,117 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:38:57,118 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:38:57,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:38:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 780. [2020-01-16 18:38:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-01-16 18:38:57,137 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-01-16 18:38:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:57,138 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-01-16 18:38:57,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-01-16 18:38:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:57,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:57,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:57,139 INFO L426 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash 612146687, now seen corresponding path program 860 times [2020-01-16 18:38:57,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:57,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749689713] [2020-01-16 18:38:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:57,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749689713] [2020-01-16 18:38:57,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:57,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:57,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383132405] [2020-01-16 18:38:57,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:57,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:57,495 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:38:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:57,618 INFO L93 Difference]: Finished difference Result 1215 states and 4282 transitions. [2020-01-16 18:38:57,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:57,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:57,621 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:38:57,621 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:38:57,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:38:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 777. [2020-01-16 18:38:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:38:57,642 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:38:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:57,642 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:38:57,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:38:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:57,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:57,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:57,643 INFO L426 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1695735171, now seen corresponding path program 861 times [2020-01-16 18:38:57,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857066522] [2020-01-16 18:38:57,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857066522] [2020-01-16 18:38:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713852658] [2020-01-16 18:38:58,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:58,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:58,003 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:38:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:58,124 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-01-16 18:38:58,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:58,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:58,127 INFO L225 Difference]: With dead ends: 1225 [2020-01-16 18:38:58,127 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:38:58,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:38:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 783. [2020-01-16 18:38:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:38:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-01-16 18:38:58,148 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-01-16 18:38:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:58,148 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-01-16 18:38:58,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-01-16 18:38:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:58,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:58,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:58,149 INFO L426 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash 622649791, now seen corresponding path program 862 times [2020-01-16 18:38:58,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:58,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243116365] [2020-01-16 18:38:58,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:58,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243116365] [2020-01-16 18:38:58,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:58,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:58,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060802028] [2020-01-16 18:38:58,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:58,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:58,527 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:38:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:58,653 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:38:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:58,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:58,657 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:38:58,657 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:38:58,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:38:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-01-16 18:38:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:38:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:38:58,677 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:38:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:58,677 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:38:58,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:38:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:58,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:58,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:58,678 INFO L426 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1706238275, now seen corresponding path program 863 times [2020-01-16 18:38:58,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:58,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127193594] [2020-01-16 18:38:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:59,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127193594] [2020-01-16 18:38:59,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:59,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:59,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313050205] [2020-01-16 18:38:59,031 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:59,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:59,031 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:38:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:59,165 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:38:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:59,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:59,168 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:38:59,169 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:38:59,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:38:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-01-16 18:38:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:38:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-01-16 18:38:59,189 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-01-16 18:38:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:59,189 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-01-16 18:38:59,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-01-16 18:38:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:59,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:59,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:59,191 INFO L426 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -977788063, now seen corresponding path program 864 times [2020-01-16 18:38:59,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:59,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746480342] [2020-01-16 18:38:59,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:38:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:38:59,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746480342] [2020-01-16 18:38:59,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:38:59,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:38:59,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426520899] [2020-01-16 18:38:59,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:38:59,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:38:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:38:59,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:38:59,543 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:38:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:38:59,667 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-01-16 18:38:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:38:59,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:38:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:38:59,671 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:38:59,671 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:38:59,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:38:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:38:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 771. [2020-01-16 18:38:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:38:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3085 transitions. [2020-01-16 18:38:59,691 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3085 transitions. Word has length 25 [2020-01-16 18:38:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:38:59,691 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3085 transitions. [2020-01-16 18:38:59,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:38:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3085 transitions. [2020-01-16 18:38:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:38:59,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:38:59,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:38:59,692 INFO L426 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:38:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:38:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2060165155, now seen corresponding path program 865 times [2020-01-16 18:38:59,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:38:59,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452468664] [2020-01-16 18:38:59,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:38:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:00,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452468664] [2020-01-16 18:39:00,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:00,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:00,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395819778] [2020-01-16 18:39:00,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:00,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:00,038 INFO L87 Difference]: Start difference. First operand 771 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:39:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:00,165 INFO L93 Difference]: Finished difference Result 1196 states and 4235 transitions. [2020-01-16 18:39:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:00,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:00,168 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:00,169 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:39:00,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:39:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 780. [2020-01-16 18:39:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:39:00,189 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:39:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:00,189 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:39:00,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:39:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:00,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:00,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:00,191 INFO L426 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1089913541, now seen corresponding path program 866 times [2020-01-16 18:39:00,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:00,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883504663] [2020-01-16 18:39:00,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:00,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-01-16 18:39:00,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883504663] [2020-01-16 18:39:00,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:00,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:00,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139061502] [2020-01-16 18:39:00,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:00,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:00,541 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:39:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:00,684 INFO L93 Difference]: Finished difference Result 1198 states and 4235 transitions. [2020-01-16 18:39:00,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:00,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:00,687 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:39:00,687 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:39:00,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:39:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-01-16 18:39:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3102 transitions. [2020-01-16 18:39:00,706 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3102 transitions. Word has length 25 [2020-01-16 18:39:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:00,706 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3102 transitions. [2020-01-16 18:39:00,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3102 transitions. [2020-01-16 18:39:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:00,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:00,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:00,707 INFO L426 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash -134131077, now seen corresponding path program 867 times [2020-01-16 18:39:00,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:00,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279101874] [2020-01-16 18:39:00,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:01,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279101874] [2020-01-16 18:39:01,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:01,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:01,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576937334] [2020-01-16 18:39:01,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:01,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:01,059 INFO L87 Difference]: Start difference. First operand 776 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:39:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:01,187 INFO L93 Difference]: Finished difference Result 1192 states and 4223 transitions. [2020-01-16 18:39:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:01,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:01,191 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:39:01,191 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:39:01,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:39:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-01-16 18:39:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3107 transitions. [2020-01-16 18:39:01,210 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3107 transitions. Word has length 25 [2020-01-16 18:39:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:01,211 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3107 transitions. [2020-01-16 18:39:01,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3107 transitions. [2020-01-16 18:39:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:01,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:01,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:01,212 INFO L426 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 846623641, now seen corresponding path program 868 times [2020-01-16 18:39:01,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:01,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080343247] [2020-01-16 18:39:01,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080343247] [2020-01-16 18:39:01,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:01,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:01,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576371708] [2020-01-16 18:39:01,565 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:01,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:01,565 INFO L87 Difference]: Start difference. First operand 779 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:39:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:01,715 INFO L93 Difference]: Finished difference Result 1191 states and 4218 transitions. [2020-01-16 18:39:01,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:01,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:01,718 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:39:01,718 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:39:01,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:39:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-01-16 18:39:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3099 transitions. [2020-01-16 18:39:01,738 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3099 transitions. Word has length 25 [2020-01-16 18:39:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:01,739 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3099 transitions. [2020-01-16 18:39:01,739 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3099 transitions. [2020-01-16 18:39:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:01,740 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:01,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] [2020-01-16 18:39:01,740 INFO L426 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -751288355, now seen corresponding path program 869 times [2020-01-16 18:39:01,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:01,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8991988] [2020-01-16 18:39:01,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:02,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8991988] [2020-01-16 18:39:02,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:02,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167444899] [2020-01-16 18:39:02,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:02,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:02,090 INFO L87 Difference]: Start difference. First operand 776 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:39:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:02,220 INFO L93 Difference]: Finished difference Result 1196 states and 4228 transitions. [2020-01-16 18:39:02,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:02,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:02,223 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:02,223 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:39:02,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:39:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:39:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:39:02,243 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:39:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:02,243 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:39:02,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:39:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:02,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:02,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:02,244 INFO L426 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash 859652603, now seen corresponding path program 870 times [2020-01-16 18:39:02,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:02,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134700074] [2020-01-16 18:39:02,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:02,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-01-16 18:39:02,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134700074] [2020-01-16 18:39:02,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:02,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:02,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027151207] [2020-01-16 18:39:02,586 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:02,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:02,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:02,587 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:39:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:02,730 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-01-16 18:39:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:02,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:02,734 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:39:02,734 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:02,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-01-16 18:39:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3092 transitions. [2020-01-16 18:39:02,754 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:02,754 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3092 transitions. [2020-01-16 18:39:02,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3092 transitions. [2020-01-16 18:39:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:02,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:02,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:02,755 INFO L426 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 544859237, now seen corresponding path program 871 times [2020-01-16 18:39:02,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:02,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990856511] [2020-01-16 18:39:02,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:03,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-01-16 18:39:03,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990856511] [2020-01-16 18:39:03,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:03,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:03,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004796314] [2020-01-16 18:39:03,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:03,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:03,109 INFO L87 Difference]: Start difference. First operand 773 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:03,258 INFO L93 Difference]: Finished difference Result 1192 states and 4221 transitions. [2020-01-16 18:39:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:03,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:03,261 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:39:03,262 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:39:03,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:39:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-01-16 18:39:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-01-16 18:39:03,282 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-01-16 18:39:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:03,282 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-01-16 18:39:03,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-01-16 18:39:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:03,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:03,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:03,283 INFO L426 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1515110851, now seen corresponding path program 872 times [2020-01-16 18:39:03,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:03,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793029026] [2020-01-16 18:39:03,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:03,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-01-16 18:39:03,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793029026] [2020-01-16 18:39:03,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:03,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:03,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702067337] [2020-01-16 18:39:03,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:03,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:03,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:03,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:03,627 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:39:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:03,754 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-01-16 18:39:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:03,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:03,758 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:03,758 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:03,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:39:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:39:03,778 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:39:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:03,779 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:39:03,779 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:39:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:03,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:03,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:03,780 INFO L426 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1585095035, now seen corresponding path program 873 times [2020-01-16 18:39:03,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:03,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544257783] [2020-01-16 18:39:03,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:04,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544257783] [2020-01-16 18:39:04,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:04,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:04,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675583323] [2020-01-16 18:39:04,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:04,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:04,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:04,120 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:39:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:04,244 INFO L93 Difference]: Finished difference Result 1186 states and 4205 transitions. [2020-01-16 18:39:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:04,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:04,247 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:39:04,248 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:39:04,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:39:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-01-16 18:39:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:39:04,268 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:39:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:04,268 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:39:04,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:39:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:04,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:04,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:04,270 INFO L426 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1687105127, now seen corresponding path program 874 times [2020-01-16 18:39:04,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:04,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110149173] [2020-01-16 18:39:04,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:04,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110149173] [2020-01-16 18:39:04,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:04,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:04,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859813128] [2020-01-16 18:39:04,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:04,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:04,613 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:39:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:04,745 INFO L93 Difference]: Finished difference Result 1184 states and 4199 transitions. [2020-01-16 18:39:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:04,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:04,749 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:39:04,749 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:39:04,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:39:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:39:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:39:04,769 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:39:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:04,769 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:39:04,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:39:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:04,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:04,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] [2020-01-16 18:39:04,770 INFO L426 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1138846363, now seen corresponding path program 875 times [2020-01-16 18:39:04,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:04,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022682133] [2020-01-16 18:39:04,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:05,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-01-16 18:39:05,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022682133] [2020-01-16 18:39:05,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:05,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:05,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785374616] [2020-01-16 18:39:05,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:05,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:05,104 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:39:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:05,230 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-01-16 18:39:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:05,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:05,234 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:39:05,234 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:05,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:39:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:39:05,266 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:05,266 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:39:05,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:39:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:05,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:05,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:05,267 INFO L426 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:05,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1674076165, now seen corresponding path program 876 times [2020-01-16 18:39:05,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:05,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622097464] [2020-01-16 18:39:05,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:05,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622097464] [2020-01-16 18:39:05,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:05,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753288318] [2020-01-16 18:39:05,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:05,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:05,613 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:05,745 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-01-16 18:39:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:05,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:05,749 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:39:05,749 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:39:05,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:39:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:39:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:39:05,769 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:05,769 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:39:05,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:39:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:05,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:05,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] [2020-01-16 18:39:05,770 INFO L426 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2048407589, now seen corresponding path program 877 times [2020-01-16 18:39:05,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896793533] [2020-01-16 18:39:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:06,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896793533] [2020-01-16 18:39:06,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:06,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:06,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390100333] [2020-01-16 18:39:06,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:06,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:06,125 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:06,262 INFO L93 Difference]: Finished difference Result 1184 states and 4201 transitions. [2020-01-16 18:39:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:06,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:06,265 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:39:06,265 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:39:06,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:39:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 778. [2020-01-16 18:39:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:39:06,285 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:39:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:06,285 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:39:06,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:39:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:06,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:06,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:06,287 INFO L426 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1265804989, now seen corresponding path program 878 times [2020-01-16 18:39:06,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:06,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644173908] [2020-01-16 18:39:06,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:06,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644173908] [2020-01-16 18:39:06,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:06,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:06,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503434156] [2020-01-16 18:39:06,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:06,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:06,639 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:39:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:06,776 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-01-16 18:39:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:06,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:06,780 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:39:06,780 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:39:06,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:39:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:39:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:39:06,800 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:39:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:06,800 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:39:06,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:39:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:06,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:06,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:06,801 INFO L426 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1162609309, now seen corresponding path program 879 times [2020-01-16 18:39:06,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:06,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599427942] [2020-01-16 18:39:06,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:07,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599427942] [2020-01-16 18:39:07,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:07,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:07,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149204759] [2020-01-16 18:39:07,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:07,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:07,153 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:39:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:07,287 INFO L93 Difference]: Finished difference Result 1182 states and 4194 transitions. [2020-01-16 18:39:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:07,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:07,290 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:39:07,290 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:39:07,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:39:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:39:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:39:07,310 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:07,310 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:39:07,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:39:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:07,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:07,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:07,311 INFO L426 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2109590853, now seen corresponding path program 880 times [2020-01-16 18:39:07,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:07,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261371164] [2020-01-16 18:39:07,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:07,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261371164] [2020-01-16 18:39:07,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:07,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:07,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555143269] [2020-01-16 18:39:07,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:07,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:07,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:07,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:07,679 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:07,811 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:39:07,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:07,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:07,814 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:39:07,814 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:39:07,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:39:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-01-16 18:39:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:39:07,834 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:07,834 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:39:07,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:39:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:07,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:07,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:07,836 INFO L426 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 375205093, now seen corresponding path program 881 times [2020-01-16 18:39:07,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:07,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299726396] [2020-01-16 18:39:07,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:08,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299726396] [2020-01-16 18:39:08,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:08,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:08,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346131093] [2020-01-16 18:39:08,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:08,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:08,195 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:08,326 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:39:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:08,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:08,329 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:39:08,329 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:39:08,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:39:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:39:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:39:08,350 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:08,350 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:39:08,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:39:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:08,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:08,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:08,351 INFO L426 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1770965667, now seen corresponding path program 882 times [2020-01-16 18:39:08,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:08,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115793955] [2020-01-16 18:39:08,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:08,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115793955] [2020-01-16 18:39:08,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:08,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:08,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892224635] [2020-01-16 18:39:08,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:08,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:08,709 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:08,846 INFO L93 Difference]: Finished difference Result 1179 states and 4184 transitions. [2020-01-16 18:39:08,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:08,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:08,850 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:39:08,850 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:39:08,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:39:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 773. [2020-01-16 18:39:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:39:08,870 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:39:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:08,870 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:39:08,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:39:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:08,871 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:08,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:08,871 INFO L426 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1419583365, now seen corresponding path program 883 times [2020-01-16 18:39:08,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:08,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062747133] [2020-01-16 18:39:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:09,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062747133] [2020-01-16 18:39:09,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:09,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:09,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139036184] [2020-01-16 18:39:09,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:09,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:09,223 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:39:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:09,353 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-01-16 18:39:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:09,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:09,356 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:39:09,356 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:09,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 778. [2020-01-16 18:39:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:39:09,376 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:39:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:09,376 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:39:09,376 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:39:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:09,377 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:09,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:09,377 INFO L426 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash 191357593, now seen corresponding path program 884 times [2020-01-16 18:39:09,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:09,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544677286] [2020-01-16 18:39:09,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:09,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544677286] [2020-01-16 18:39:09,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:09,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:09,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331711153] [2020-01-16 18:39:09,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:09,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:09,746 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:39:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:09,895 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:39:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:09,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:09,898 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:39:09,899 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:39:09,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:39:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-01-16 18:39:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:39:09,918 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:09,918 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:39:09,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:39:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:09,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:09,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:09,920 INFO L426 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash 768599811, now seen corresponding path program 885 times [2020-01-16 18:39:09,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:09,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317975211] [2020-01-16 18:39:09,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:10,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317975211] [2020-01-16 18:39:10,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:10,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:10,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025267791] [2020-01-16 18:39:10,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:10,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:10,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:10,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:10,269 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:10,399 INFO L93 Difference]: Finished difference Result 1188 states and 4204 transitions. [2020-01-16 18:39:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:10,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:10,402 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:39:10,402 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:39:10,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:39:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-01-16 18:39:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:39:10,424 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:10,424 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:39:10,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:39:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:10,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:10,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:10,425 INFO L426 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 233370009, now seen corresponding path program 886 times [2020-01-16 18:39:10,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:10,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666914857] [2020-01-16 18:39:10,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:10,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666914857] [2020-01-16 18:39:10,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:10,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:10,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705875130] [2020-01-16 18:39:10,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:10,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:10,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:10,774 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:10,907 INFO L93 Difference]: Finished difference Result 1184 states and 4194 transitions. [2020-01-16 18:39:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:10,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:10,910 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:39:10,910 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:39:10,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:39:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:39:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:10,930 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:10,930 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:10,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:10,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:10,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:10,931 INFO L426 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 779102915, now seen corresponding path program 887 times [2020-01-16 18:39:10,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:10,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071764182] [2020-01-16 18:39:10,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:11,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071764182] [2020-01-16 18:39:11,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:11,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:11,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171275139] [2020-01-16 18:39:11,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:11,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:11,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:11,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:11,288 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:11,418 INFO L93 Difference]: Finished difference Result 1182 states and 4190 transitions. [2020-01-16 18:39:11,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:11,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:11,421 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:39:11,421 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:39:11,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:39:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:39:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:11,442 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:11,442 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:11,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:11,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:11,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:11,443 INFO L426 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1367067845, now seen corresponding path program 888 times [2020-01-16 18:39:11,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:11,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796089777] [2020-01-16 18:39:11,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:11,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796089777] [2020-01-16 18:39:11,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:11,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:11,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774414399] [2020-01-16 18:39:11,808 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:11,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:11,815 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:11,954 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:39:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:11,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:11,957 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:39:11,957 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:39:11,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:39:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 771. [2020-01-16 18:39:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:39:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-01-16 18:39:11,976 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-01-16 18:39:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:11,976 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-01-16 18:39:11,976 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-01-16 18:39:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:11,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:11,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:11,978 INFO L426 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1600160797, now seen corresponding path program 889 times [2020-01-16 18:39:11,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:11,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598784459] [2020-01-16 18:39:11,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:12,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598784459] [2020-01-16 18:39:12,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:12,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617037465] [2020-01-16 18:39:12,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:12,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:12,320 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:39:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:12,457 INFO L93 Difference]: Finished difference Result 1214 states and 4281 transitions. [2020-01-16 18:39:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:12,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:12,461 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:39:12,461 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:39:12,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:39:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 781. [2020-01-16 18:39:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3114 transitions. [2020-01-16 18:39:12,481 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3114 transitions. Word has length 25 [2020-01-16 18:39:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:12,481 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3114 transitions. [2020-01-16 18:39:12,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3114 transitions. [2020-01-16 18:39:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:12,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:12,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:12,482 INFO L426 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1724554885, now seen corresponding path program 890 times [2020-01-16 18:39:12,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:12,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990830706] [2020-01-16 18:39:12,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18: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-01-16 18:39:12,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990830706] [2020-01-16 18:39:12,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:12,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863414339] [2020-01-16 18:39:12,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:12,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:12,823 INFO L87 Difference]: Start difference. First operand 781 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:39:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:12,975 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:39:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:12,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:12,978 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:39:12,978 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:39:12,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:39:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-01-16 18:39:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-01-16 18:39:12,999 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-01-16 18:39:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:12,999 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-01-16 18:39:12,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-01-16 18:39:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:13,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:13,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:13,000 INFO L426 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:13,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1157261657, now seen corresponding path program 891 times [2020-01-16 18:39:13,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:13,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333365242] [2020-01-16 18:39:13,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:13,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-01-16 18:39:13,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333365242] [2020-01-16 18:39:13,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:13,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:13,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614496575] [2020-01-16 18:39:13,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:13,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:13,331 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:39:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:13,458 INFO L93 Difference]: Finished difference Result 1215 states and 4279 transitions. [2020-01-16 18:39:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:13,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:13,461 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:39:13,461 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:39:13,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:39:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-01-16 18:39:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:39:13,481 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:39:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:13,481 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:39:13,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:39:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:13,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:13,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:13,482 INFO L426 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2146447817, now seen corresponding path program 892 times [2020-01-16 18:39:13,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:13,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186142410] [2020-01-16 18:39:13,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:13,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186142410] [2020-01-16 18:39:13,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:13,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:13,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187853934] [2020-01-16 18:39:13,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:13,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:13,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:13,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:13,820 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:39:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:13,960 INFO L93 Difference]: Finished difference Result 1218 states and 4281 transitions. [2020-01-16 18:39:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:13,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:13,963 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:39:13,963 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:39:13,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:39:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:39:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-01-16 18:39:13,984 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-01-16 18:39:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:13,984 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-01-16 18:39:13,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-01-16 18:39:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:13,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:13,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:13,985 INFO L426 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1060333475, now seen corresponding path program 893 times [2020-01-16 18:39:13,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:13,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025250025] [2020-01-16 18:39:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:14,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025250025] [2020-01-16 18:39:14,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:14,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:14,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206031680] [2020-01-16 18:39:14,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:14,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:14,334 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:39:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:14,464 INFO L93 Difference]: Finished difference Result 1221 states and 4289 transitions. [2020-01-16 18:39:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:14,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:14,468 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:39:14,468 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:39:14,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:39:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-01-16 18:39:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:39:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-01-16 18:39:14,487 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-01-16 18:39:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:14,487 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-01-16 18:39:14,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-01-16 18:39:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:14,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:14,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:14,489 INFO L426 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2133418855, now seen corresponding path program 894 times [2020-01-16 18:39:14,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:14,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176666832] [2020-01-16 18:39:14,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:14,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176666832] [2020-01-16 18:39:14,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:14,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:14,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507837074] [2020-01-16 18:39:14,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:14,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:14,827 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:39:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:14,956 INFO L93 Difference]: Finished difference Result 1222 states and 4285 transitions. [2020-01-16 18:39:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:14,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:14,960 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:39:14,960 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:39:14,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:39:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 773. [2020-01-16 18:39:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:39:14,981 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:14,981 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:39:14,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:39:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:14,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:14,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:14,982 INFO L426 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 332703619, now seen corresponding path program 895 times [2020-01-16 18:39:14,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:14,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460614250] [2020-01-16 18:39:14,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:15,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460614250] [2020-01-16 18:39:15,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:15,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:15,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861912076] [2020-01-16 18:39:15,310 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:15,310 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:15,439 INFO L93 Difference]: Finished difference Result 1201 states and 4243 transitions. [2020-01-16 18:39:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:15,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:15,442 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:39:15,443 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:39:15,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:39:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-01-16 18:39:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:39:15,463 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:39:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:15,464 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:39:15,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:39:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:15,465 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:15,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:15,465 INFO L426 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1302955233, now seen corresponding path program 896 times [2020-01-16 18:39:15,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:15,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228676217] [2020-01-16 18:39:15,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:15,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-01-16 18:39:15,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228676217] [2020-01-16 18:39:15,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:15,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:15,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723882325] [2020-01-16 18:39:15,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:15,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:15,806 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:39:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:15,937 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-01-16 18:39:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:15,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:15,940 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:39:15,940 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:39:15,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:39:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-01-16 18:39:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:39:15,960 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:39:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:15,960 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:39:15,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:39:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:15,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:15,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:15,961 INFO L426 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1372939417, now seen corresponding path program 897 times [2020-01-16 18:39:15,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:15,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870861018] [2020-01-16 18:39:15,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:16,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-01-16 18:39:16,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870861018] [2020-01-16 18:39:16,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:16,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:16,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642848223] [2020-01-16 18:39:16,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:16,292 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:39:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:16,423 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-01-16 18:39:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:16,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:16,427 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:39:16,427 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:16,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:39:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:39:16,447 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:16,447 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:39:16,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:39:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:16,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:16,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:16,448 INFO L426 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1899260745, now seen corresponding path program 898 times [2020-01-16 18:39:16,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:16,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118895768] [2020-01-16 18:39:16,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:16,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118895768] [2020-01-16 18:39:16,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:16,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:16,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700885205] [2020-01-16 18:39:16,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:16,787 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:16,919 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:39:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:16,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:16,923 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:39:16,923 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:39:16,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:39:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-01-16 18:39:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:39:16,943 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:16,943 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:39:16,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:39:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:16,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:16,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:16,944 INFO L426 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1351001981, now seen corresponding path program 899 times [2020-01-16 18:39:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:16,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12183875] [2020-01-16 18:39:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:17,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12183875] [2020-01-16 18:39:17,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:17,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:17,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969905893] [2020-01-16 18:39:17,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:17,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:17,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:17,258 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:17,419 INFO L93 Difference]: Finished difference Result 1199 states and 4233 transitions. [2020-01-16 18:39:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:17,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:17,422 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:39:17,422 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:39:17,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:39:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-01-16 18:39:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:39:17,442 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:17,442 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:39:17,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:39:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:17,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:17,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:17,443 INFO L426 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1886231783, now seen corresponding path program 900 times [2020-01-16 18:39:17,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:17,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551435576] [2020-01-16 18:39:17,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:17,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551435576] [2020-01-16 18:39:17,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:17,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:17,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141344696] [2020-01-16 18:39:17,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:17,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:17,776 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:17,907 INFO L93 Difference]: Finished difference Result 1195 states and 4223 transitions. [2020-01-16 18:39:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:17,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:17,911 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:39:17,911 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:39:17,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:39:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 773. [2020-01-16 18:39:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:39:17,930 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:39:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:17,931 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:39:17,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:39:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:17,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:17,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:17,932 INFO L426 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash -955166973, now seen corresponding path program 901 times [2020-01-16 18:39:17,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:17,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730482424] [2020-01-16 18:39:17,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:18,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730482424] [2020-01-16 18:39:18,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:18,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:18,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440978132] [2020-01-16 18:39:18,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:18,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:18,261 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:39:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:18,413 INFO L93 Difference]: Finished difference Result 1203 states and 4245 transitions. [2020-01-16 18:39:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:18,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:18,415 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:39:18,416 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:39:18,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:39:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 779. [2020-01-16 18:39:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:39:18,436 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:39:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:18,436 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:39:18,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:39:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:18,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:18,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:18,438 INFO L426 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash 36090849, now seen corresponding path program 902 times [2020-01-16 18:39:18,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:18,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291633748] [2020-01-16 18:39:18,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:18,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-01-16 18:39:18,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291633748] [2020-01-16 18:39:18,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:18,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:18,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033967885] [2020-01-16 18:39:18,768 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:18,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:18,768 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:39:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:18,900 INFO L93 Difference]: Finished difference Result 1206 states and 4247 transitions. [2020-01-16 18:39:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:18,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:18,903 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:39:18,903 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:18,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 775. [2020-01-16 18:39:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:39:18,923 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:18,923 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:39:18,923 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:39:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:18,924 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:18,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:18,924 INFO L426 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 527967965, now seen corresponding path program 903 times [2020-01-16 18:39:18,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:18,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754909819] [2020-01-16 18:39:18,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:19,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754909819] [2020-01-16 18:39:19,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:19,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:19,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945082687] [2020-01-16 18:39:19,251 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:19,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:19,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:19,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:19,252 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:19,394 INFO L93 Difference]: Finished difference Result 1196 states and 4227 transitions. [2020-01-16 18:39:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:19,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:19,398 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:19,398 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:39:19,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:39:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-01-16 18:39:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:39:19,417 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:19,418 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:39:19,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:39:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:19,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:19,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:19,419 INFO L426 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1550735099, now seen corresponding path program 904 times [2020-01-16 18:39:19,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:19,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022465696] [2020-01-16 18:39:19,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:19,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022465696] [2020-01-16 18:39:19,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:19,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:19,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189741890] [2020-01-16 18:39:19,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:19,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:19,743 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:19,877 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-01-16 18:39:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:19,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:19,881 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:19,881 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:39:19,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:39:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:39:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:19,901 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:19,901 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:19,901 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:19,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:19,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:19,902 INFO L426 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1677100931, now seen corresponding path program 905 times [2020-01-16 18:39:19,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:19,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736635197] [2020-01-16 18:39:19,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:20,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736635197] [2020-01-16 18:39:20,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:20,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:20,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346660350] [2020-01-16 18:39:20,229 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:20,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:20,230 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:20,378 INFO L93 Difference]: Finished difference Result 1202 states and 4237 transitions. [2020-01-16 18:39:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:20,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:20,382 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:20,382 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:20,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:39:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:20,402 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:20,402 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:20,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:20,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:20,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:20,404 INFO L426 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2080010787, now seen corresponding path program 906 times [2020-01-16 18:39:20,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:20,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83947335] [2020-01-16 18:39:20,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:20,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83947335] [2020-01-16 18:39:20,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:20,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:20,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856690905] [2020-01-16 18:39:20,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:20,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:20,734 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:20,885 INFO L93 Difference]: Finished difference Result 1197 states and 4225 transitions. [2020-01-16 18:39:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:20,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:20,889 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:39:20,889 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:20,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:39:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:39:20,912 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:39:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:20,913 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:39:20,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:39:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:20,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:20,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:20,914 INFO L426 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1728628485, now seen corresponding path program 907 times [2020-01-16 18:39:20,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:20,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234873654] [2020-01-16 18:39:20,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:21,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234873654] [2020-01-16 18:39:21,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:21,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:21,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012081727] [2020-01-16 18:39:21,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:21,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:21,262 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:39:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:21,392 INFO L93 Difference]: Finished difference Result 1213 states and 4267 transitions. [2020-01-16 18:39:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:21,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:21,395 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:39:21,395 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:39:21,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:39:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-01-16 18:39:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:39:21,415 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:39:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:21,415 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:39:21,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:39:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:21,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:21,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:21,416 INFO L426 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1493253431, now seen corresponding path program 908 times [2020-01-16 18:39:21,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:21,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437017627] [2020-01-16 18:39:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:21,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437017627] [2020-01-16 18:39:21,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:21,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:21,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501524075] [2020-01-16 18:39:21,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:21,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:21,744 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:39:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:21,872 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-01-16 18:39:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:21,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:21,875 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:39:21,876 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:39:21,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:39:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:39:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:21,896 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:21,896 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:21,896 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:21,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:21,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:21,897 INFO L426 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2059992545, now seen corresponding path program 909 times [2020-01-16 18:39:21,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:21,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824551542] [2020-01-16 18:39:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:22,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824551542] [2020-01-16 18:39:22,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:22,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:22,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285245497] [2020-01-16 18:39:22,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:22,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:22,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:22,214 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:22,359 INFO L93 Difference]: Finished difference Result 1204 states and 4243 transitions. [2020-01-16 18:39:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:22,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:22,362 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:39:22,362 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:39:22,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:39:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-01-16 18:39:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:22,382 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:22,382 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:22,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:22,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:22,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:22,384 INFO L426 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:22,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1524762743, now seen corresponding path program 910 times [2020-01-16 18:39:22,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:22,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142503746] [2020-01-16 18:39:22,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:22,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-01-16 18:39:22,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142503746] [2020-01-16 18:39:22,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:22,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:22,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431667942] [2020-01-16 18:39:22,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:22,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:22,714 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:22,863 INFO L93 Difference]: Finished difference Result 1200 states and 4233 transitions. [2020-01-16 18:39:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:22,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:22,867 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:39:22,867 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:39:22,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:39:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-01-16 18:39:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:39:22,887 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:39:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:22,887 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:39:22,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:39:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:22,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:22,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] [2020-01-16 18:39:22,888 INFO L426 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2080998753, now seen corresponding path program 911 times [2020-01-16 18:39:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:22,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430030138] [2020-01-16 18:39:22,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:23,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430030138] [2020-01-16 18:39:23,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:23,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:23,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464275979] [2020-01-16 18:39:23,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:23,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:23,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:23,213 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:39:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:23,339 INFO L93 Difference]: Finished difference Result 1206 states and 4245 transitions. [2020-01-16 18:39:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:23,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:23,343 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:39:23,343 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:39:23,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:39:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:39:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:39:23,364 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:23,364 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:39:23,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:39:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:23,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:23,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:23,365 INFO L426 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1676112965, now seen corresponding path program 912 times [2020-01-16 18:39:23,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:23,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869523188] [2020-01-16 18:39:23,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:23,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869523188] [2020-01-16 18:39:23,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:23,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:23,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140843908] [2020-01-16 18:39:23,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:23,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:23,699 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:23,845 INFO L93 Difference]: Finished difference Result 1201 states and 4233 transitions. [2020-01-16 18:39:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:23,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:23,849 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:39:23,849 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:39:23,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:39:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-01-16 18:39:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:39:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:39:23,869 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:39:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:23,869 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:39:23,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:39:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:23,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:23,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:23,870 INFO L426 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1403413765, now seen corresponding path program 913 times [2020-01-16 18:39:23,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:23,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277281825] [2020-01-16 18:39:23,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277281825] [2020-01-16 18:39:24,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:24,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:24,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168080828] [2020-01-16 18:39:24,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:24,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:24,241 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:39:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:24,378 INFO L93 Difference]: Finished difference Result 1194 states and 4226 transitions. [2020-01-16 18:39:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:24,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:24,382 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:24,382 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:39:24,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:39:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:39:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-01-16 18:39:24,402 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-01-16 18:39:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:24,402 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-01-16 18:39:24,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-01-16 18:39:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:24,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:24,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:24,404 INFO L426 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash -422659047, now seen corresponding path program 914 times [2020-01-16 18:39:24,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:24,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534523922] [2020-01-16 18:39:24,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:24,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534523922] [2020-01-16 18:39:24,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:24,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:24,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12928443] [2020-01-16 18:39:24,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:24,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:24,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:24,758 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:39:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:24,906 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:39:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:24,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:24,910 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:39:24,910 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:24,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 776. [2020-01-16 18:39:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3098 transitions. [2020-01-16 18:39:24,929 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:24,930 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3098 transitions. [2020-01-16 18:39:24,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3098 transitions. [2020-01-16 18:39:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:24,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:24,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:24,931 INFO L426 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 522620313, now seen corresponding path program 915 times [2020-01-16 18:39:24,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:24,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512511241] [2020-01-16 18:39:24,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:25,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512511241] [2020-01-16 18:39:25,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:25,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:25,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236908555] [2020-01-16 18:39:25,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:25,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:25,280 INFO L87 Difference]: Start difference. First operand 776 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:25,407 INFO L93 Difference]: Finished difference Result 1199 states and 4234 transitions. [2020-01-16 18:39:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:25,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:25,411 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:39:25,411 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:25,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-01-16 18:39:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:39:25,431 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:39:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:25,431 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:39:25,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:39:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:25,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:25,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:25,433 INFO L426 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1513878135, now seen corresponding path program 916 times [2020-01-16 18:39:25,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:25,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64165904] [2020-01-16 18:39:25,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:25,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64165904] [2020-01-16 18:39:25,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:25,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:25,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847927065] [2020-01-16 18:39:25,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:25,796 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:39:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:25,927 INFO L93 Difference]: Finished difference Result 1202 states and 4236 transitions. [2020-01-16 18:39:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:25,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:25,930 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:25,930 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:25,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 776. [2020-01-16 18:39:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3095 transitions. [2020-01-16 18:39:25,951 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3095 transitions. Word has length 25 [2020-01-16 18:39:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:25,951 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3095 transitions. [2020-01-16 18:39:25,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3095 transitions. [2020-01-16 18:39:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:25,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:25,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:25,953 INFO L426 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 241562363, now seen corresponding path program 917 times [2020-01-16 18:39:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:25,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545253681] [2020-01-16 18:39:25,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:26,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545253681] [2020-01-16 18:39:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:26,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:26,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843297959] [2020-01-16 18:39:26,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:26,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:26,307 INFO L87 Difference]: Start difference. First operand 776 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:39:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:26,433 INFO L93 Difference]: Finished difference Result 1196 states and 4224 transitions. [2020-01-16 18:39:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:26,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:26,437 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:26,437 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:39:26,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:39:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-01-16 18:39:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:39:26,457 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:39:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:26,457 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:39:26,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:39:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:26,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:26,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:26,458 INFO L426 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1852503321, now seen corresponding path program 918 times [2020-01-16 18:39:26,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:26,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740101724] [2020-01-16 18:39:26,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:26,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740101724] [2020-01-16 18:39:26,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:26,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:26,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430360894] [2020-01-16 18:39:26,808 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:26,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:26,809 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:39:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:26,947 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:39:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:26,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:26,950 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:39:26,950 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:26,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-01-16 18:39:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:39:26,970 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:39:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:26,970 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:39:26,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:39:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:26,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:26,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:26,971 INFO L426 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1624096353, now seen corresponding path program 919 times [2020-01-16 18:39:26,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:26,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26029841] [2020-01-16 18:39:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:27,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26029841] [2020-01-16 18:39:27,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:27,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:27,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73579987] [2020-01-16 18:39:27,338 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:27,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:27,339 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:39:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:27,468 INFO L93 Difference]: Finished difference Result 1185 states and 4201 transitions. [2020-01-16 18:39:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:27,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:27,472 INFO L225 Difference]: With dead ends: 1185 [2020-01-16 18:39:27,472 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:39:27,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:39:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:39:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:39:27,492 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:39:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:27,492 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:39:27,492 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:39:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:27,493 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:27,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:27,493 INFO L426 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:27,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1690116225, now seen corresponding path program 920 times [2020-01-16 18:39:27,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:27,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464974667] [2020-01-16 18:39:27,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:27,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464974667] [2020-01-16 18:39:27,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:27,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:27,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026385268] [2020-01-16 18:39:27,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:27,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:27,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:27,852 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:39:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:27,981 INFO L93 Difference]: Finished difference Result 1184 states and 4196 transitions. [2020-01-16 18:39:27,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:27,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:27,985 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:39:27,985 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:39:27,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:39:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:39:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:39:28,004 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:28,005 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:39:28,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:39:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:28,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:28,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:28,006 INFO L426 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 738298073, now seen corresponding path program 921 times [2020-01-16 18:39:28,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:28,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788584264] [2020-01-16 18:39:28,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:28,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788584264] [2020-01-16 18:39:28,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:28,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456041570] [2020-01-16 18:39:28,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:28,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:28,370 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:28,510 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-01-16 18:39:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:28,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:28,513 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:39:28,514 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:39:28,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:39:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:39:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:39:28,533 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:28,533 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:39:28,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:39:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:28,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:28,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:28,535 INFO L426 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1761065207, now seen corresponding path program 922 times [2020-01-16 18:39:28,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:28,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386352368] [2020-01-16 18:39:28,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:28,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386352368] [2020-01-16 18:39:28,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:28,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:28,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832036113] [2020-01-16 18:39:28,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:28,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:28,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:28,885 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:29,048 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-01-16 18:39:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:29,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:29,052 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:39:29,052 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:39:29,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:39:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:39:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:29,071 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:29,071 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:29,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:29,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:29,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:29,072 INFO L426 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash -49106143, now seen corresponding path program 923 times [2020-01-16 18:39:29,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:29,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832400445] [2020-01-16 18:39:29,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:29,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832400445] [2020-01-16 18:39:29,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:29,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:29,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029791307] [2020-01-16 18:39:29,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:29,429 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:29,567 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-01-16 18:39:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:29,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:29,570 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:39:29,570 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:39:29,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:39:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:39:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:29,590 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:29,590 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:29,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:29,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:29,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] [2020-01-16 18:39:29,592 INFO L426 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2099690393, now seen corresponding path program 924 times [2020-01-16 18:39:29,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:29,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228604029] [2020-01-16 18:39:29,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:29,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228604029] [2020-01-16 18:39:29,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:29,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:29,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672626006] [2020-01-16 18:39:29,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:29,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:29,955 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:30,116 INFO L93 Difference]: Finished difference Result 1180 states and 4184 transitions. [2020-01-16 18:39:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:30,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:30,119 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:39:30,119 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:39:30,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:39:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:39:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:39:30,139 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:39:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:30,139 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:39:30,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:39:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:30,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:30,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:30,140 INFO L426 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1167322591, now seen corresponding path program 925 times [2020-01-16 18:39:30,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:30,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359952894] [2020-01-16 18:39:30,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:30,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-01-16 18:39:30,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359952894] [2020-01-16 18:39:30,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:30,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:30,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770091257] [2020-01-16 18:39:30,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:30,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:30,481 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:39:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:30,619 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-01-16 18:39:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:30,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:30,622 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:39:30,622 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:30,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:39:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:39:30,641 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:39:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:30,641 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:39:30,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:39:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:30,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:30,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:30,642 INFO L426 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash -176064769, now seen corresponding path program 926 times [2020-01-16 18:39:30,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:30,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920459645] [2020-01-16 18:39:30,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:30,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920459645] [2020-01-16 18:39:30,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:30,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:30,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096265498] [2020-01-16 18:39:30,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:30,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:30,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:30,991 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:39:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:31,182 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-01-16 18:39:31,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:31,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:31,185 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:39:31,185 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:31,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:39:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:31,204 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:31,204 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:31,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:31,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:31,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:31,205 INFO L426 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 315812347, now seen corresponding path program 927 times [2020-01-16 18:39:31,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410510883] [2020-01-16 18:39:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:31,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410510883] [2020-01-16 18:39:31,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:31,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:31,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995801925] [2020-01-16 18:39:31,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:31,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:31,553 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:31,691 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-01-16 18:39:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:31,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:31,695 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:39:31,695 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:31,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:39:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:31,715 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:31,715 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:31,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:31,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:31,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:31,716 INFO L426 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1338579481, now seen corresponding path program 928 times [2020-01-16 18:39:31,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:31,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239879384] [2020-01-16 18:39:31,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:32,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239879384] [2020-01-16 18:39:32,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:32,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:32,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155006495] [2020-01-16 18:39:32,062 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:32,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:32,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:32,062 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:32,204 INFO L93 Difference]: Finished difference Result 1186 states and 4197 transitions. [2020-01-16 18:39:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:32,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:32,207 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:39:32,207 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:39:32,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:39:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:39:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:39:32,228 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:39:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:32,228 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:39:32,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:39:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:32,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:32,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:32,229 INFO L426 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1464945313, now seen corresponding path program 929 times [2020-01-16 18:39:32,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:32,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342808874] [2020-01-16 18:39:32,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:32,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342808874] [2020-01-16 18:39:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:32,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10525036] [2020-01-16 18:39:32,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:32,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:32,588 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:39:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:32,726 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-01-16 18:39:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:32,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:32,730 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:32,730 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:32,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:39:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:39:32,750 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:32,750 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:39:32,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:39:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:32,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:32,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:32,751 INFO L426 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2002800891, now seen corresponding path program 930 times [2020-01-16 18:39:32,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:32,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870536741] [2020-01-16 18:39:32,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:33,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-01-16 18:39:33,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870536741] [2020-01-16 18:39:33,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:33,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:33,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531401542] [2020-01-16 18:39:33,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:33,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:33,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:33,105 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:33,285 INFO L93 Difference]: Finished difference Result 1189 states and 4201 transitions. [2020-01-16 18:39:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:33,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:33,289 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:39:33,289 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:39:33,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:39:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-01-16 18:39:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:39:33,308 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:39:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:33,309 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:39:33,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:39:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:33,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:33,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:33,310 INFO L426 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:33,310 INFO L82 PathProgramCache]: Analyzing trace with hash -426732647, now seen corresponding path program 931 times [2020-01-16 18:39:33,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:33,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775052357] [2020-01-16 18:39:33,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:33,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775052357] [2020-01-16 18:39:33,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:33,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:33,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711292977] [2020-01-16 18:39:33,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:33,666 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:39:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:33,803 INFO L93 Difference]: Finished difference Result 1190 states and 4207 transitions. [2020-01-16 18:39:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:33,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:33,806 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:39:33,807 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:33,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-01-16 18:39:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:39:33,827 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:33,827 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:39:33,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:39:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:33,828 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:33,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:33,828 INFO L426 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1184208311, now seen corresponding path program 932 times [2020-01-16 18:39:33,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:33,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746493383] [2020-01-16 18:39:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:34,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746493383] [2020-01-16 18:39:34,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:34,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:34,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629751397] [2020-01-16 18:39:34,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:34,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:34,172 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:34,349 INFO L93 Difference]: Finished difference Result 1194 states and 4212 transitions. [2020-01-16 18:39:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:34,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:34,352 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:34,352 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:34,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:39:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:39:34,372 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:39:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:34,372 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:39:34,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:39:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:34,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:34,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:34,374 INFO L426 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash -933078913, now seen corresponding path program 933 times [2020-01-16 18:39:34,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:34,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334985595] [2020-01-16 18:39:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:34,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334985595] [2020-01-16 18:39:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:34,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531844730] [2020-01-16 18:39:34,725 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:34,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:34,725 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:39:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:34,867 INFO L93 Difference]: Finished difference Result 1184 states and 4192 transitions. [2020-01-16 18:39:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:34,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:34,871 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:39:34,871 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:39:34,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:39:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:39:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:39:34,890 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:34,891 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:39:34,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:39:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:34,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:34,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:34,892 INFO L426 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1215717623, now seen corresponding path program 934 times [2020-01-16 18:39:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:34,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702476312] [2020-01-16 18:39:34,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:35,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702476312] [2020-01-16 18:39:35,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:35,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:35,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148005772] [2020-01-16 18:39:35,250 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:35,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:35,251 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:35,416 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:39:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:35,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:35,419 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:39:35,419 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:39:35,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:39:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:39:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:39:35,439 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:39:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:35,439 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:39:35,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:39:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:35,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:35,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:35,440 INFO L426 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash -922575809, now seen corresponding path program 935 times [2020-01-16 18:39:35,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:35,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049003564] [2020-01-16 18:39:35,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:35,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049003564] [2020-01-16 18:39:35,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:35,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:35,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953017912] [2020-01-16 18:39:35,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:35,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:35,788 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:39:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:35,926 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-01-16 18:39:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:35,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:35,929 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:39:35,929 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:39:35,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:39:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:39:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:39:35,949 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:35,949 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:39:35,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:39:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:35,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:35,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:35,950 INFO L426 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -384720231, now seen corresponding path program 936 times [2020-01-16 18:39:35,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:35,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852734723] [2020-01-16 18:39:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:36,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852734723] [2020-01-16 18:39:36,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:36,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:36,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541284911] [2020-01-16 18:39:36,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:36,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:36,304 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:36,496 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-01-16 18:39:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:36,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:36,499 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:39:36,499 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:39:36,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:39:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 771. [2020-01-16 18:39:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:39:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:39:36,519 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:39:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:36,519 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:39:36,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:39:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:36,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:36,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:36,520 INFO L426 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -241103101, now seen corresponding path program 937 times [2020-01-16 18:39:36,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:36,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633741913] [2020-01-16 18:39:36,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:36,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-01-16 18:39:36,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633741913] [2020-01-16 18:39:36,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:36,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:36,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210947309] [2020-01-16 18:39:36,876 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:36,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:36,877 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:39:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:37,010 INFO L93 Difference]: Finished difference Result 1206 states and 4252 transitions. [2020-01-16 18:39:37,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:37,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:37,013 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:39:37,013 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:39:37,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:39:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 779. [2020-01-16 18:39:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:39:37,035 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:39:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:37,035 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:39:37,035 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:39:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:37,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:37,036 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:37,036 INFO L426 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1369837857, now seen corresponding path program 938 times [2020-01-16 18:39:37,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:37,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508688194] [2020-01-16 18:39:37,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:37,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508688194] [2020-01-16 18:39:37,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:37,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:37,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423494170] [2020-01-16 18:39:37,400 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:37,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:37,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:37,400 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:39:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:37,555 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-01-16 18:39:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:37,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:37,558 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:39:37,558 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:39:37,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:39:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-01-16 18:39:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:39:37,579 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:37,579 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:39:37,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:39:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:37,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:37,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:37,581 INFO L426 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1841540955, now seen corresponding path program 939 times [2020-01-16 18:39:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:37,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614441740] [2020-01-16 18:39:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614441740] [2020-01-16 18:39:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951457025] [2020-01-16 18:39:37,952 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:37,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:37,952 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:38,083 INFO L93 Difference]: Finished difference Result 1213 states and 4266 transitions. [2020-01-16 18:39:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:38,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:38,086 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:39:38,086 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:39:38,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:39:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-01-16 18:39:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:39:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:39:38,106 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:39:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:38,106 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:39:38,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:39:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:38,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:38,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:38,108 INFO L426 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1380340961, now seen corresponding path program 940 times [2020-01-16 18:39:38,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:38,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462646491] [2020-01-16 18:39:38,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:38,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462646491] [2020-01-16 18:39:38,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:38,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:38,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098032034] [2020-01-16 18:39:38,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:38,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:38,495 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:39:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:38,654 INFO L93 Difference]: Finished difference Result 1214 states and 4262 transitions. [2020-01-16 18:39:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:38,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:38,657 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:39:38,657 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:39:38,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:39:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-01-16 18:39:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:39:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:39:38,677 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:38,677 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:39:38,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:39:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:38,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:38,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:38,678 INFO L426 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1831037851, now seen corresponding path program 941 times [2020-01-16 18:39:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:38,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999083119] [2020-01-16 18:39:38,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:39,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999083119] [2020-01-16 18:39:39,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:39,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:39,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690559773] [2020-01-16 18:39:39,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:39,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:39,036 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:39,172 INFO L93 Difference]: Finished difference Result 1204 states and 4242 transitions. [2020-01-16 18:39:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:39,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:39,175 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:39:39,175 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:39:39,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:39:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 779. [2020-01-16 18:39:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:39:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:39:39,204 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:39,204 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:39:39,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:39:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:39,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:39,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:39,205 INFO L426 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash -220096893, now seen corresponding path program 942 times [2020-01-16 18:39:39,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:39,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986204006] [2020-01-16 18:39:39,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:39,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986204006] [2020-01-16 18:39:39,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:39,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:39,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106719580] [2020-01-16 18:39:39,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:39,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:39,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:39,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:39,564 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:39,722 INFO L93 Difference]: Finished difference Result 1208 states and 4247 transitions. [2020-01-16 18:39:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:39,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:39,725 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:39:39,725 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:39,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-01-16 18:39:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:39:39,745 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:39:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:39,746 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:39:39,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:39:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:39,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:39,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:39,747 INFO L426 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031837, now seen corresponding path program 943 times [2020-01-16 18:39:39,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:39,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676338675] [2020-01-16 18:39:39,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676338675] [2020-01-16 18:39:40,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:40,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:40,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367313859] [2020-01-16 18:39:40,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:40,100 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:39:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:40,280 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-01-16 18:39:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:40,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:40,283 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:39:40,283 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:39:40,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:39:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 778. [2020-01-16 18:39:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:39:40,303 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:40,304 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:39:40,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:39:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:40,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:40,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:40,305 INFO L426 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1441994501, now seen corresponding path program 944 times [2020-01-16 18:39:40,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:40,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453604029] [2020-01-16 18:39:40,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:40,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453604029] [2020-01-16 18:39:40,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:40,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:40,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070819371] [2020-01-16 18:39:40,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:40,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:40,668 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:40,805 INFO L93 Difference]: Finished difference Result 1192 states and 4212 transitions. [2020-01-16 18:39:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:40,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:40,809 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:39:40,809 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:39:40,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:39:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:39:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:39:40,829 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:39:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:40,829 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:39:40,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:39:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:40,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:40,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:40,830 INFO L426 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -864752283, now seen corresponding path program 945 times [2020-01-16 18:39:40,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:40,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222609631] [2020-01-16 18:39:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:41,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222609631] [2020-01-16 18:39:41,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:41,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:41,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356413950] [2020-01-16 18:39:41,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:41,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:41,176 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:39:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:41,312 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:39:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:41,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:41,315 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:39:41,315 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:39:41,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:39:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:39:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:39:41,335 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:41,335 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:39:41,335 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:39:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:41,336 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:41,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:41,337 INFO L426 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1399982085, now seen corresponding path program 946 times [2020-01-16 18:39:41,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:41,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198035243] [2020-01-16 18:39:41,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:41,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-01-16 18:39:41,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198035243] [2020-01-16 18:39:41,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:41,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:41,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280963913] [2020-01-16 18:39:41,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:41,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:41,690 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:41,832 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-01-16 18:39:41,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:41,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:41,836 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:39:41,836 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:39:41,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:39:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:39:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:39:41,857 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:39:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:41,857 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:39:41,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:39:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:41,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:41,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:41,858 INFO L426 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -854249179, now seen corresponding path program 947 times [2020-01-16 18:39:41,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:41,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311624982] [2020-01-16 18:39:41,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:42,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311624982] [2020-01-16 18:39:42,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:42,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:42,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334978146] [2020-01-16 18:39:42,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:42,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:42,225 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:39:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:42,363 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-01-16 18:39:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:42,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:42,366 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:39:42,366 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:39:42,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:39:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:39:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:39:42,386 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:42,386 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:39:42,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:39:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:42,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:42,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:42,387 INFO L426 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1294547357, now seen corresponding path program 948 times [2020-01-16 18:39:42,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:42,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851226669] [2020-01-16 18:39:42,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:42,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-01-16 18:39:42,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851226669] [2020-01-16 18:39:42,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:42,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:42,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424932785] [2020-01-16 18:39:42,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:42,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:42,745 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:42,882 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-01-16 18:39:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:42,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:42,886 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:39:42,886 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:39:42,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:39:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:39:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:39:42,905 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:39:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:42,905 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:39:42,906 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:39:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:42,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:42,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:42,907 INFO L426 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1567628061, now seen corresponding path program 949 times [2020-01-16 18:39:42,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:42,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904746847] [2020-01-16 18:39:42,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:43,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904746847] [2020-01-16 18:39:43,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:43,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:43,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045761098] [2020-01-16 18:39:43,249 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:43,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:43,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:43,249 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:39:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:43,382 INFO L93 Difference]: Finished difference Result 1209 states and 4253 transitions. [2020-01-16 18:39:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:43,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:43,385 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:39:43,385 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:39:43,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:39:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:39:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:39:43,405 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:39:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:43,406 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:39:43,406 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:39:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:43,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:43,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:43,407 INFO L426 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 494542681, now seen corresponding path program 950 times [2020-01-16 18:39:43,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:43,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516869721] [2020-01-16 18:39:43,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:43,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-01-16 18:39:43,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516869721] [2020-01-16 18:39:43,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:43,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:43,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734069736] [2020-01-16 18:39:43,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:43,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:43,766 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:39:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:43,902 INFO L93 Difference]: Finished difference Result 1210 states and 4249 transitions. [2020-01-16 18:39:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:43,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:43,905 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:39:43,906 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:39:43,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:39:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-01-16 18:39:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:39:43,926 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:39:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:43,926 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:39:43,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:39:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:43,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:43,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:43,927 INFO L426 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:43,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1061281795, now seen corresponding path program 951 times [2020-01-16 18:39:43,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:43,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597815219] [2020-01-16 18:39:43,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:44,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597815219] [2020-01-16 18:39:44,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:44,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:44,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123108492] [2020-01-16 18:39:44,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:44,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:44,269 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:39:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:44,404 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:39:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:44,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:44,408 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:39:44,408 INFO L226 Difference]: Without dead ends: 1185 [2020-01-16 18:39:44,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-01-16 18:39:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 777. [2020-01-16 18:39:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:39:44,428 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:39:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:44,428 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:39:44,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:39:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:44,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:44,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:44,429 INFO L426 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 526051993, now seen corresponding path program 952 times [2020-01-16 18:39:44,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:44,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718871060] [2020-01-16 18:39:44,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:44,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-01-16 18:39:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718871060] [2020-01-16 18:39:44,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:44,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:44,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487623190] [2020-01-16 18:39:44,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:44,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:44,778 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:39:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:44,906 INFO L93 Difference]: Finished difference Result 1196 states and 4219 transitions. [2020-01-16 18:39:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:44,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:44,909 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:44,910 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:39:44,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:39:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-01-16 18:39:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:39:44,930 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:39:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:44,930 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:39:44,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:39:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:44,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:44,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:44,931 INFO L426 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1082288003, now seen corresponding path program 953 times [2020-01-16 18:39:44,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:44,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212627356] [2020-01-16 18:39:44,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:45,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-01-16 18:39:45,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212627356] [2020-01-16 18:39:45,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:45,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:45,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268852012] [2020-01-16 18:39:45,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:45,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:45,301 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:39:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:45,437 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-01-16 18:39:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:45,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:45,441 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:45,441 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:45,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:39:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:39:45,461 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:45,462 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:39:45,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:39:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:45,463 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:45,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:45,463 INFO L426 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1620143581, now seen corresponding path program 954 times [2020-01-16 18:39:45,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:45,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396673332] [2020-01-16 18:39:45,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:45,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-01-16 18:39:45,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396673332] [2020-01-16 18:39:45,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:45,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:45,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598632890] [2020-01-16 18:39:45,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:45,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:45,816 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:45,959 INFO L93 Difference]: Finished difference Result 1197 states and 4219 transitions. [2020-01-16 18:39:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:45,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:45,962 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:39:45,962 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:45,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:39:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:39:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:39:45,982 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:39:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:45,982 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:39:45,982 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:39:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:45,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:45,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:45,984 INFO L426 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -790802053, now seen corresponding path program 955 times [2020-01-16 18:39:45,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:45,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22361150] [2020-01-16 18:39:45,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:46,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22361150] [2020-01-16 18:39:46,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:46,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:46,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928625342] [2020-01-16 18:39:46,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:46,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:46,336 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:39:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:46,462 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-01-16 18:39:46,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:46,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:46,465 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:39:46,465 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:39:46,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:39:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 778. [2020-01-16 18:39:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:39:46,485 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:39:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:46,486 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:39:46,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:39:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:46,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:46,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:46,487 INFO L426 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 820138905, now seen corresponding path program 956 times [2020-01-16 18:39:46,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:46,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269716719] [2020-01-16 18:39:46,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:46,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269716719] [2020-01-16 18:39:46,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:46,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:46,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188228072] [2020-01-16 18:39:46,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:46,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:46,850 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:39:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:46,993 INFO L93 Difference]: Finished difference Result 1198 states and 4220 transitions. [2020-01-16 18:39:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:46,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:46,996 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:39:46,997 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:39:46,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:39:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 775. [2020-01-16 18:39:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:39:47,017 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:39:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:47,017 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:39:47,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:39:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:47,018 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:47,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:47,018 INFO L426 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1297148319, now seen corresponding path program 957 times [2020-01-16 18:39:47,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:47,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565611358] [2020-01-16 18:39:47,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:47,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565611358] [2020-01-16 18:39:47,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:47,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:47,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338664093] [2020-01-16 18:39:47,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:47,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:47,369 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:39:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:47,491 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-01-16 18:39:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:47,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:47,495 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:39:47,495 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:39:47,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:39:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:39:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:39:47,515 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:47,515 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:39:47,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:39:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:47,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:47,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:47,517 INFO L426 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash 851648217, now seen corresponding path program 958 times [2020-01-16 18:39:47,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:47,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022117429] [2020-01-16 18:39:47,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:47,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022117429] [2020-01-16 18:39:47,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:47,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:47,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407143557] [2020-01-16 18:39:47,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:47,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:47,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:47,868 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:48,004 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-01-16 18:39:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:48,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:48,007 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:39:48,007 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:39:48,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:39:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:39:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:39:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:39:48,027 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:39:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:48,027 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:39:48,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:39:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:48,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:48,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:48,028 INFO L426 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:48,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1286645215, now seen corresponding path program 959 times [2020-01-16 18:39:48,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:48,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778090738] [2020-01-16 18:39:48,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:48,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778090738] [2020-01-16 18:39:48,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:48,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:48,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470346480] [2020-01-16 18:39:48,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:48,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:48,377 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:39:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:48,517 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-01-16 18:39:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:48,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:48,520 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:39:48,520 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:39:48,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:39:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:39:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:39:48,539 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:39:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:48,540 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:39:48,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:39:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:48,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:48,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:48,541 INFO L426 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash -748789637, now seen corresponding path program 960 times [2020-01-16 18:39:48,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:48,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329350039] [2020-01-16 18:39:48,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:48,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329350039] [2020-01-16 18:39:48,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:48,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:48,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118877346] [2020-01-16 18:39:48,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:48,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:48,892 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:39:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:49,025 INFO L93 Difference]: Finished difference Result 1191 states and 4202 transitions. [2020-01-16 18:39:49,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:49,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:49,029 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:39:49,029 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:39:49,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:39:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 769. [2020-01-16 18:39:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:39:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3074 transitions. [2020-01-16 18:39:49,049 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3074 transitions. Word has length 25 [2020-01-16 18:39:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:49,049 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3074 transitions. [2020-01-16 18:39:49,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3074 transitions. [2020-01-16 18:39:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:49,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:49,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] [2020-01-16 18:39:49,050 INFO L426 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 377256515, now seen corresponding path program 961 times [2020-01-16 18:39:49,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:49,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238737563] [2020-01-16 18:39:49,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:49,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238737563] [2020-01-16 18:39:49,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:49,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:49,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815763102] [2020-01-16 18:39:49,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:49,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:49,414 INFO L87 Difference]: Start difference. First operand 769 states and 3074 transitions. Second operand 10 states. [2020-01-16 18:39:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:49,543 INFO L93 Difference]: Finished difference Result 1207 states and 4273 transitions. [2020-01-16 18:39:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:49,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:49,546 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:39:49,546 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:39:49,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:39:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:39:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3117 transitions. [2020-01-16 18:39:49,566 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3117 transitions. Word has length 25 [2020-01-16 18:39:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:49,566 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3117 transitions. [2020-01-16 18:39:49,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3117 transitions. [2020-01-16 18:39:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:49,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:49,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:49,568 INFO L426 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1347508129, now seen corresponding path program 962 times [2020-01-16 18:39:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:49,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971729424] [2020-01-16 18:39:49,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:49,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971729424] [2020-01-16 18:39:49,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:49,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:49,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829456937] [2020-01-16 18:39:49,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:49,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:49,934 INFO L87 Difference]: Start difference. First operand 781 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:39:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:50,075 INFO L93 Difference]: Finished difference Result 1209 states and 4273 transitions. [2020-01-16 18:39:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:50,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:50,078 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:39:50,078 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:39:50,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:39:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:39:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3107 transitions. [2020-01-16 18:39:50,098 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3107 transitions. Word has length 25 [2020-01-16 18:39:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:50,098 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3107 transitions. [2020-01-16 18:39:50,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3107 transitions. [2020-01-16 18:39:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:50,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:50,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:50,099 INFO L426 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1991676703, now seen corresponding path program 963 times [2020-01-16 18:39:50,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:50,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094043635] [2020-01-16 18:39:50,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094043635] [2020-01-16 18:39:50,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:50,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:50,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252372594] [2020-01-16 18:39:50,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:50,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:50,495 INFO L87 Difference]: Start difference. First operand 777 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:39:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:50,630 INFO L93 Difference]: Finished difference Result 1203 states and 4261 transitions. [2020-01-16 18:39:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:50,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:50,633 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:39:50,634 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:39:50,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:39:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-01-16 18:39:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:39:50,654 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:39:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:50,654 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:39:50,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:39:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:50,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:50,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:50,655 INFO L426 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1010921985, now seen corresponding path program 964 times [2020-01-16 18:39:50,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:50,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062765696] [2020-01-16 18:39:50,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:51,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062765696] [2020-01-16 18:39:51,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:51,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:51,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939211020] [2020-01-16 18:39:51,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:51,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:51,027 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:39:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:51,164 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-01-16 18:39:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:51,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:51,167 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:51,168 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:39:51,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:39:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-01-16 18:39:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3104 transitions. [2020-01-16 18:39:51,188 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3104 transitions. Word has length 25 [2020-01-16 18:39:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:51,188 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3104 transitions. [2020-01-16 18:39:51,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3104 transitions. [2020-01-16 18:39:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:51,189 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:51,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:51,189 INFO L426 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1686133315, now seen corresponding path program 965 times [2020-01-16 18:39:51,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:51,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348438326] [2020-01-16 18:39:51,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:51,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348438326] [2020-01-16 18:39:51,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:51,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:51,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53701437] [2020-01-16 18:39:51,558 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:51,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:51,559 INFO L87 Difference]: Start difference. First operand 777 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:39:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:51,688 INFO L93 Difference]: Finished difference Result 1207 states and 4266 transitions. [2020-01-16 18:39:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:51,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:51,692 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:39:51,692 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:39:51,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:39:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-01-16 18:39:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-01-16 18:39:51,712 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-01-16 18:39:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:51,712 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-01-16 18:39:51,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-01-16 18:39:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:51,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:51,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:51,714 INFO L426 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -997893023, now seen corresponding path program 966 times [2020-01-16 18:39:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458349094] [2020-01-16 18:39:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:52,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458349094] [2020-01-16 18:39:52,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:52,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:52,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776768430] [2020-01-16 18:39:52,110 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:52,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:52,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:52,110 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:39:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:52,245 INFO L93 Difference]: Finished difference Result 1204 states and 4257 transitions. [2020-01-16 18:39:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:52,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:52,248 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:39:52,248 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:52,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-01-16 18:39:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:39:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3096 transitions. [2020-01-16 18:39:52,269 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3096 transitions. Word has length 25 [2020-01-16 18:39:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:52,269 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3096 transitions. [2020-01-16 18:39:52,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3096 transitions. [2020-01-16 18:39:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:52,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:52,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:52,271 INFO L426 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -467714937, now seen corresponding path program 967 times [2020-01-16 18:39:52,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:52,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870177948] [2020-01-16 18:39:52,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:52,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870177948] [2020-01-16 18:39:52,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:52,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:52,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428551830] [2020-01-16 18:39:52,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:52,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:52,639 INFO L87 Difference]: Start difference. First operand 774 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:39:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:52,763 INFO L93 Difference]: Finished difference Result 1213 states and 4287 transitions. [2020-01-16 18:39:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:52,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:52,766 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:39:52,766 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:39:52,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:39:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 782. [2020-01-16 18:39:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:39:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-01-16 18:39:52,787 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-01-16 18:39:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:52,787 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-01-16 18:39:52,787 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-01-16 18:39:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:52,788 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:52,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:52,788 INFO L426 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 502536677, now seen corresponding path program 968 times [2020-01-16 18:39:52,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:52,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338577600] [2020-01-16 18:39:52,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:53,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338577600] [2020-01-16 18:39:53,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:53,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:53,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495919252] [2020-01-16 18:39:53,155 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:53,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:53,155 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:39:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:53,286 INFO L93 Difference]: Finished difference Result 1215 states and 4287 transitions. [2020-01-16 18:39:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:53,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:53,289 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:39:53,290 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:39:53,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:39:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 778. [2020-01-16 18:39:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3107 transitions. [2020-01-16 18:39:53,310 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3107 transitions. Word has length 25 [2020-01-16 18:39:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:53,310 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3107 transitions. [2020-01-16 18:39:53,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3107 transitions. [2020-01-16 18:39:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:53,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:53,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:53,312 INFO L426 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1015420001, now seen corresponding path program 969 times [2020-01-16 18:39:53,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:53,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530602399] [2020-01-16 18:39:53,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:53,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530602399] [2020-01-16 18:39:53,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:53,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:53,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405958544] [2020-01-16 18:39:53,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:53,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:53,687 INFO L87 Difference]: Start difference. First operand 778 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:39:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:53,837 INFO L93 Difference]: Finished difference Result 1212 states and 4281 transitions. [2020-01-16 18:39:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:53,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:53,840 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:39:53,841 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:39:53,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:39:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 782. [2020-01-16 18:39:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:39:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3114 transitions. [2020-01-16 18:39:53,860 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3114 transitions. Word has length 25 [2020-01-16 18:39:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:53,861 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3114 transitions. [2020-01-16 18:39:53,861 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3114 transitions. [2020-01-16 18:39:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:53,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:53,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:53,862 INFO L426 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2017180927, now seen corresponding path program 970 times [2020-01-16 18:39:53,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:53,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494652304] [2020-01-16 18:39:53,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:54,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494652304] [2020-01-16 18:39:54,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:54,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:54,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742475189] [2020-01-16 18:39:54,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:54,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:54,234 INFO L87 Difference]: Start difference. First operand 782 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:39:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:54,373 INFO L93 Difference]: Finished difference Result 1213 states and 4279 transitions. [2020-01-16 18:39:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:54,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:54,377 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:39:54,377 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:39:54,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:39:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-01-16 18:39:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:39:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3103 transitions. [2020-01-16 18:39:54,397 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3103 transitions. Word has length 25 [2020-01-16 18:39:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:54,397 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3103 transitions. [2020-01-16 18:39:54,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3103 transitions. [2020-01-16 18:39:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:54,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:54,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:54,398 INFO L426 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1492354311, now seen corresponding path program 971 times [2020-01-16 18:39:54,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:54,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125729760] [2020-01-16 18:39:54,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:54,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125729760] [2020-01-16 18:39:54,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:54,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:54,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264437867] [2020-01-16 18:39:54,773 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:54,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:54,774 INFO L87 Difference]: Start difference. First operand 778 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:39:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:54,916 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-01-16 18:39:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:54,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:54,919 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:39:54,919 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:39:54,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:39:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 783. [2020-01-16 18:39:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:39:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:39:54,939 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:39:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:54,939 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:39:54,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:39:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:54,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:54,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:54,940 INFO L426 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2030209889, now seen corresponding path program 972 times [2020-01-16 18:39:54,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:54,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093231660] [2020-01-16 18:39:54,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:55,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093231660] [2020-01-16 18:39:55,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:55,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:55,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946449969] [2020-01-16 18:39:55,314 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:55,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:55,314 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:39:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:55,443 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:39:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:55,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:55,446 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:39:55,446 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:39:55,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:39:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 774. [2020-01-16 18:39:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:39:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3093 transitions. [2020-01-16 18:39:55,466 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3093 transitions. Word has length 25 [2020-01-16 18:39:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:55,466 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3093 transitions. [2020-01-16 18:39:55,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3093 transitions. [2020-01-16 18:39:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:55,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:55,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:55,467 INFO L426 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1035833415, now seen corresponding path program 973 times [2020-01-16 18:39:55,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:55,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304636723] [2020-01-16 18:39:55,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:55,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304636723] [2020-01-16 18:39:55,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:55,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:55,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814748536] [2020-01-16 18:39:55,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:55,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:55,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:55,851 INFO L87 Difference]: Start difference. First operand 774 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:39:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:55,999 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-01-16 18:39:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:56,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:56,002 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:56,003 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:39:56,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:39:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-01-16 18:39:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-01-16 18:39:56,023 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-01-16 18:39:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:56,023 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-01-16 18:39:56,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-01-16 18:39:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:56,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:56,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:56,024 INFO L426 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:56,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2016588133, now seen corresponding path program 974 times [2020-01-16 18:39:56,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:56,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448640262] [2020-01-16 18:39:56,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:56,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448640262] [2020-01-16 18:39:56,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:56,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:56,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101572601] [2020-01-16 18:39:56,394 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:56,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:56,394 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:39:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:56,529 INFO L93 Difference]: Finished difference Result 1201 states and 4251 transitions. [2020-01-16 18:39:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:56,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:56,532 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:39:56,532 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:39:56,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:39:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:39:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:39:56,552 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:39:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:56,553 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:39:56,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:39:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:56,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:56,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:56,554 INFO L426 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 592934275, now seen corresponding path program 975 times [2020-01-16 18:39:56,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:56,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473501146] [2020-01-16 18:39:56,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:56,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473501146] [2020-01-16 18:39:56,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:56,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:56,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41820465] [2020-01-16 18:39:56,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:56,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:56,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:56,927 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:39:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:57,067 INFO L93 Difference]: Finished difference Result 1205 states and 4260 transitions. [2020-01-16 18:39:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:57,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:57,070 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:39:57,070 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:39:57,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:39:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-01-16 18:39:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:39:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:39:57,090 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:39:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:57,090 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:39:57,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:39:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:57,091 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:57,091 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:57,091 INFO L426 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1594695201, now seen corresponding path program 976 times [2020-01-16 18:39:57,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:57,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076237306] [2020-01-16 18:39:57,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:57,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076237306] [2020-01-16 18:39:57,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:57,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:57,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393708760] [2020-01-16 18:39:57,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:57,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:57,494 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:39:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:57,645 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-01-16 18:39:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:57,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:57,649 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:39:57,649 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:39:57,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:39:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-01-16 18:39:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:39:57,669 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:57,669 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:39:57,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:39:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:57,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:57,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:57,670 INFO L426 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1288561529, now seen corresponding path program 977 times [2020-01-16 18:39:57,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:57,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371358159] [2020-01-16 18:39:57,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:58,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371358159] [2020-01-16 18:39:58,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:58,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:58,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227970597] [2020-01-16 18:39:58,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:58,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:58,039 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:39:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:58,187 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-01-16 18:39:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:58,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:58,190 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:39:58,190 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:39:58,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:39:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-01-16 18:39:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:39:58,211 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:39:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:58,211 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:39:58,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:39:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:58,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:58,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:58,212 INFO L426 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1933320387, now seen corresponding path program 978 times [2020-01-16 18:39:58,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259113318] [2020-01-16 18:39:58,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:58,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-01-16 18:39:58,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259113318] [2020-01-16 18:39:58,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:58,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:58,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491873748] [2020-01-16 18:39:58,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:58,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:58,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:58,578 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:39:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:58,721 INFO L93 Difference]: Finished difference Result 1204 states and 4251 transitions. [2020-01-16 18:39:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:58,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:58,725 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:39:58,725 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:39:58,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:39:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 774. [2020-01-16 18:39:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:39:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-01-16 18:39:58,744 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-01-16 18:39:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:58,744 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-01-16 18:39:58,745 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-01-16 18:39:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:58,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:58,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:58,746 INFO L426 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258399, now seen corresponding path program 979 times [2020-01-16 18:39:58,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:58,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770313612] [2020-01-16 18:39:58,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:59,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-01-16 18:39:59,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770313612] [2020-01-16 18:39:59,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:59,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:59,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263318610] [2020-01-16 18:39:59,108 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:59,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:59,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:59,109 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:39:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:59,242 INFO L93 Difference]: Finished difference Result 1209 states and 4268 transitions. [2020-01-16 18:39:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:59,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:59,246 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:39:59,246 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:39:59,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:39:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 780. [2020-01-16 18:39:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:39:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-01-16 18:39:59,266 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-01-16 18:39:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:59,266 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-01-16 18:39:59,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-01-16 18:39:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:59,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:59,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:59,267 INFO L426 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -378317441, now seen corresponding path program 980 times [2020-01-16 18:39:59,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:59,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787498847] [2020-01-16 18:39:59,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:39:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:39:59,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787498847] [2020-01-16 18:39:59,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:39:59,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:39:59,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676744765] [2020-01-16 18:39:59,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:39:59,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:39:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:39:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:39:59,649 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:39:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:39:59,808 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-01-16 18:39:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:39:59,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:39:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:39:59,811 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:39:59,811 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:39:59,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:39:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:39:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:39:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:39:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:39:59,831 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:39:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:39:59,831 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:39:59,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:39:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:39:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:39:59,833 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:39:59,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:39:59,833 INFO L426 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:39:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:39:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash -895166811, now seen corresponding path program 981 times [2020-01-16 18:39:59,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:39:59,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082726527] [2020-01-16 18:39:59,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:39:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:00,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082726527] [2020-01-16 18:40:00,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:00,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:00,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487819970] [2020-01-16 18:40:00,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:00,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:00,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:00,205 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:00,330 INFO L93 Difference]: Finished difference Result 1213 states and 4275 transitions. [2020-01-16 18:40:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:00,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:00,333 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:40:00,334 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:40:00,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:40:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-01-16 18:40:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:40:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:40:00,353 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:40:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:00,354 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:40:00,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:40:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:00,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:00,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:00,355 INFO L426 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -357311233, now seen corresponding path program 982 times [2020-01-16 18:40:00,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:00,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534886045] [2020-01-16 18:40:00,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:00,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-01-16 18:40:00,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534886045] [2020-01-16 18:40:00,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:00,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884865471] [2020-01-16 18:40:00,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:00,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:00,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:00,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:00,724 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:40:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:00,876 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:40:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:00,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:00,879 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:40:00,879 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:40:00,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:40:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:40:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:40:00,900 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:40:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:00,900 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:40:00,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:40:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:00,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:00,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:00,901 INFO L426 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -884663707, now seen corresponding path program 983 times [2020-01-16 18:40:00,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:00,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271357579] [2020-01-16 18:40:00,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:01,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-01-16 18:40:01,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271357579] [2020-01-16 18:40:01,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:01,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:01,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816951733] [2020-01-16 18:40:01,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:01,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:01,297 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:40:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:01,441 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-01-16 18:40:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:01,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:01,445 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:40:01,445 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:40:01,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:40:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-01-16 18:40:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:40:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:40:01,466 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:40:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:01,466 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:40:01,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:40:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:01,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:01,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:01,467 INFO L426 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1957749087, now seen corresponding path program 984 times [2020-01-16 18:40:01,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:01,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549010306] [2020-01-16 18:40:01,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:01,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-01-16 18:40:01,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549010306] [2020-01-16 18:40:01,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:01,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:01,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89018758] [2020-01-16 18:40:01,831 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:01,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:01,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:01,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:01,832 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:40:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:02,000 INFO L93 Difference]: Finished difference Result 1207 states and 4255 transitions. [2020-01-16 18:40:02,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:02,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:02,004 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:40:02,004 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:40:02,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:40:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-01-16 18:40:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:40:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-01-16 18:40:02,025 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-01-16 18:40:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:02,025 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-01-16 18:40:02,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-01-16 18:40:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:02,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:02,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:02,026 INFO L426 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -47054721, now seen corresponding path program 985 times [2020-01-16 18:40:02,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:02,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125659387] [2020-01-16 18:40:02,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40: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-01-16 18:40:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125659387] [2020-01-16 18:40:02,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:02,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:02,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423286603] [2020-01-16 18:40:02,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:02,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:02,389 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:40:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:02,521 INFO L93 Difference]: Finished difference Result 1193 states and 4226 transitions. [2020-01-16 18:40:02,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:02,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:02,525 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:02,525 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:40:02,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:40:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 780. [2020-01-16 18:40:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:40:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3110 transitions. [2020-01-16 18:40:02,549 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3110 transitions. Word has length 25 [2020-01-16 18:40:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:02,549 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3110 transitions. [2020-01-16 18:40:02,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3110 transitions. [2020-01-16 18:40:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:02,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:02,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:02,551 INFO L426 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 923196893, now seen corresponding path program 986 times [2020-01-16 18:40:02,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:02,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191057487] [2020-01-16 18:40:02,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:02,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191057487] [2020-01-16 18:40:02,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:02,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:02,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187020535] [2020-01-16 18:40:02,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:02,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:02,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:02,928 INFO L87 Difference]: Start difference. First operand 780 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:40:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:03,079 INFO L93 Difference]: Finished difference Result 1195 states and 4226 transitions. [2020-01-16 18:40:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:03,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:03,082 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:40:03,082 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:03,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-01-16 18:40:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-01-16 18:40:03,103 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-01-16 18:40:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:03,103 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-01-16 18:40:03,103 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-01-16 18:40:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:03,104 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:03,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:03,104 INFO L426 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1878979357, now seen corresponding path program 987 times [2020-01-16 18:40:03,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:03,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384685807] [2020-01-16 18:40:03,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:03,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384685807] [2020-01-16 18:40:03,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:03,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:03,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123765108] [2020-01-16 18:40:03,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:03,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:03,513 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:40:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:03,668 INFO L93 Difference]: Finished difference Result 1189 states and 4214 transitions. [2020-01-16 18:40:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:03,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:03,671 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:03,671 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:03,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-01-16 18:40:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:40:03,691 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:40:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:03,692 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:40:03,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:40:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:03,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:03,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:03,693 INFO L426 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1435233221, now seen corresponding path program 988 times [2020-01-16 18:40:03,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:03,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903426215] [2020-01-16 18:40:03,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:04,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-01-16 18:40:04,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903426215] [2020-01-16 18:40:04,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:04,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:04,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061624888] [2020-01-16 18:40:04,061 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:04,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:04,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:04,061 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:40:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:04,232 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-01-16 18:40:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:04,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:04,235 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:40:04,235 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:40:04,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:40:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-01-16 18:40:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3097 transitions. [2020-01-16 18:40:04,255 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3097 transitions. Word has length 25 [2020-01-16 18:40:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:04,255 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3097 transitions. [2020-01-16 18:40:04,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3097 transitions. [2020-01-16 18:40:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:04,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:04,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:04,256 INFO L426 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1261822079, now seen corresponding path program 989 times [2020-01-16 18:40:04,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:04,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033698730] [2020-01-16 18:40:04,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:04,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033698730] [2020-01-16 18:40:04,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:04,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:04,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120145374] [2020-01-16 18:40:04,618 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:04,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:04,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:04,619 INFO L87 Difference]: Start difference. First operand 776 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:40:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:04,785 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-01-16 18:40:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:04,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:04,788 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:04,789 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:40:04,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:40:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 779. [2020-01-16 18:40:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:40:04,810 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:40:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:04,810 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:40:04,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:40:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:04,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:04,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:04,811 INFO L426 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1422204259, now seen corresponding path program 990 times [2020-01-16 18:40:04,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:04,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96257518] [2020-01-16 18:40:04,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:05,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96257518] [2020-01-16 18:40:05,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:05,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:05,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521010083] [2020-01-16 18:40:05,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:05,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:05,180 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:40:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:05,366 INFO L93 Difference]: Finished difference Result 1190 states and 4210 transitions. [2020-01-16 18:40:05,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:05,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:05,369 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:40:05,370 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:05,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:40:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:40:05,408 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:05,408 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:40:05,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:40:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:05,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:05,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:05,409 INFO L426 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1736997625, now seen corresponding path program 991 times [2020-01-16 18:40:05,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:05,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399482929] [2020-01-16 18:40:05,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:05,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-01-16 18:40:05,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399482929] [2020-01-16 18:40:05,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:05,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:05,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481405474] [2020-01-16 18:40:05,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:05,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:05,766 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:05,906 INFO L93 Difference]: Finished difference Result 1189 states and 4212 transitions. [2020-01-16 18:40:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:05,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:05,909 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:05,909 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:05,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-01-16 18:40:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:40:05,929 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:40:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:05,929 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:40:05,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:40:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:05,930 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:05,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:05,930 INFO L426 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash -766746011, now seen corresponding path program 992 times [2020-01-16 18:40:05,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:05,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564317422] [2020-01-16 18:40:05,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564317422] [2020-01-16 18:40:06,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:06,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070410702] [2020-01-16 18:40:06,282 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:06,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:06,283 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:40:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:06,427 INFO L93 Difference]: Finished difference Result 1191 states and 4212 transitions. [2020-01-16 18:40:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:06,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:06,430 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:40:06,430 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:06,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-01-16 18:40:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:40:06,450 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:40:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:06,450 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:40:06,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:40:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:06,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:06,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:06,452 INFO L426 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash -696761827, now seen corresponding path program 993 times [2020-01-16 18:40:06,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:06,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052648501] [2020-01-16 18:40:06,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:06,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052648501] [2020-01-16 18:40:06,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:06,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:06,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28695738] [2020-01-16 18:40:06,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:06,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:06,804 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:40:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:06,973 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-01-16 18:40:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:06,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:06,977 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:40:06,977 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:40:06,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:40:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:40:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:40:07,001 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:07,001 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:40:07,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:40:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:07,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:07,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:07,002 INFO L426 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 326005307, now seen corresponding path program 994 times [2020-01-16 18:40:07,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:07,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351146740] [2020-01-16 18:40:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:07,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-01-16 18:40:07,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351146740] [2020-01-16 18:40:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:07,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271148866] [2020-01-16 18:40:07,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:07,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:07,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:07,362 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:07,531 INFO L93 Difference]: Finished difference Result 1181 states and 4190 transitions. [2020-01-16 18:40:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:07,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:07,534 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:07,534 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:07,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:40:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:40:07,554 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:40:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:07,554 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:40:07,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:40:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:07,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:07,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] [2020-01-16 18:40:07,556 INFO L426 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash 874264071, now seen corresponding path program 995 times [2020-01-16 18:40:07,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:07,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911799475] [2020-01-16 18:40:07,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:07,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911799475] [2020-01-16 18:40:07,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:07,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:07,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388165261] [2020-01-16 18:40:07,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:07,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:07,905 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:40:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:08,040 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:40:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:08,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:08,043 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:08,044 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:08,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:40:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:40:08,063 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:08,064 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:40:08,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:40:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:08,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:08,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:08,065 INFO L426 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash 339034269, now seen corresponding path program 996 times [2020-01-16 18:40:08,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:08,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72601814] [2020-01-16 18:40:08,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:08,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72601814] [2020-01-16 18:40:08,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:08,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:08,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211823234] [2020-01-16 18:40:08,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:08,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:08,415 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:08,548 INFO L93 Difference]: Finished difference Result 1183 states and 4192 transitions. [2020-01-16 18:40:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:08,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:08,551 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:40:08,551 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:08,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-01-16 18:40:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:40:08,571 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:40:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:08,571 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:40:08,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:40:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:08,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:08,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:08,572 INFO L426 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:08,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash -233449273, now seen corresponding path program 997 times [2020-01-16 18:40:08,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:08,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39736802] [2020-01-16 18:40:08,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:08,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39736802] [2020-01-16 18:40:08,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:08,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:08,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218772163] [2020-01-16 18:40:08,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:08,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:08,943 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:40:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:09,099 INFO L93 Difference]: Finished difference Result 1181 states and 4192 transitions. [2020-01-16 18:40:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:09,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:09,102 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:09,102 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:09,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-01-16 18:40:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:40:09,123 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:40:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:09,123 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:40:09,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:40:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:09,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:09,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] [2020-01-16 18:40:09,124 INFO L426 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash 747305445, now seen corresponding path program 998 times [2020-01-16 18:40:09,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:09,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213466726] [2020-01-16 18:40:09,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:09,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213466726] [2020-01-16 18:40:09,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:09,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:09,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280271477] [2020-01-16 18:40:09,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:09,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:09,512 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:40:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:09,642 INFO L93 Difference]: Finished difference Result 1180 states and 4187 transitions. [2020-01-16 18:40:09,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:09,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:09,645 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:40:09,645 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:09,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-01-16 18:40:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:40:09,665 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:40:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:09,665 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:40:09,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:40:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:09,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:09,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:09,666 INFO L426 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:09,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1119247553, now seen corresponding path program 999 times [2020-01-16 18:40:09,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:09,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274113382] [2020-01-16 18:40:09,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:10,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274113382] [2020-01-16 18:40:10,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:10,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:10,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537612321] [2020-01-16 18:40:10,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:10,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:10,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:10,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:10,027 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:40:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:10,172 INFO L93 Difference]: Finished difference Result 1179 states and 4185 transitions. [2020-01-16 18:40:10,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:10,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:10,176 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:40:10,176 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:40:10,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:40:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-01-16 18:40:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:40:10,196 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:10,196 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:40:10,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:40:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:10,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:10,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:10,197 INFO L426 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash -96480419, now seen corresponding path program 1000 times [2020-01-16 18:40:10,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:10,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388965247] [2020-01-16 18:40:10,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:10,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388965247] [2020-01-16 18:40:10,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:10,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:10,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707503374] [2020-01-16 18:40:10,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:10,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:10,569 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:10,701 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-01-16 18:40:10,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:10,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:10,704 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:40:10,704 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:40:10,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:40:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:40:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:40:10,725 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:10,725 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:40:10,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:40:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:10,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:10,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:10,726 INFO L426 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1906651769, now seen corresponding path program 1001 times [2020-01-16 18:40:10,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:10,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374167997] [2020-01-16 18:40:10,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:11,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374167997] [2020-01-16 18:40:11,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:11,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:11,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484980744] [2020-01-16 18:40:11,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:11,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:11,101 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:11,242 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-01-16 18:40:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:11,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:11,245 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:40:11,246 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:11,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:40:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:40:11,266 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:11,266 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:40:11,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:40:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:11,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:11,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:11,267 INFO L426 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 242144767, now seen corresponding path program 1002 times [2020-01-16 18:40:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:11,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988201479] [2020-01-16 18:40:11,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:11,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988201479] [2020-01-16 18:40:11,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:11,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726768560] [2020-01-16 18:40:11,659 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:11,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:11,660 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:11,825 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:40:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:11,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:11,828 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:40:11,828 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:40:11,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:40:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-01-16 18:40:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:40:11,849 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:40:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:11,850 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:40:11,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:40:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:11,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:11,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:11,851 INFO L426 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 593527069, now seen corresponding path program 1003 times [2020-01-16 18:40:11,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:11,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118365428] [2020-01-16 18:40:11,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:12,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118365428] [2020-01-16 18:40:12,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:12,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:12,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978191550] [2020-01-16 18:40:12,218 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:12,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:12,219 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:40:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:12,371 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:40:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:12,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:12,374 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:12,374 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:12,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:40:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:40:12,394 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:12,394 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:40:12,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:40:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:12,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:12,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:12,396 INFO L426 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2090499269, now seen corresponding path program 1004 times [2020-01-16 18:40:12,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:12,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925136336] [2020-01-16 18:40:12,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:12,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925136336] [2020-01-16 18:40:12,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:12,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:12,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072725126] [2020-01-16 18:40:12,762 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:12,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:12,763 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:12,907 INFO L93 Difference]: Finished difference Result 1184 states and 4193 transitions. [2020-01-16 18:40:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:12,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:12,910 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:40:12,910 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:12,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:40:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:40:12,931 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:12,931 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:40:12,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:40:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:12,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:12,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:12,932 INFO L426 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1513257051, now seen corresponding path program 1005 times [2020-01-16 18:40:12,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:12,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276827050] [2020-01-16 18:40:12,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:13,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276827050] [2020-01-16 18:40:13,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:13,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:13,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98237692] [2020-01-16 18:40:13,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:13,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:13,286 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:13,429 INFO L93 Difference]: Finished difference Result 1185 states and 4195 transitions. [2020-01-16 18:40:13,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:13,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:13,432 INFO L225 Difference]: With dead ends: 1185 [2020-01-16 18:40:13,432 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:40:13,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:40:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:40:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:40:13,452 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:13,452 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:40:13,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:40:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:13,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:13,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:13,453 INFO L426 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2048486853, now seen corresponding path program 1006 times [2020-01-16 18:40:13,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:13,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984027449] [2020-01-16 18:40:13,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:13,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984027449] [2020-01-16 18:40:13,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:13,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:13,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503302706] [2020-01-16 18:40:13,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:13,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:13,834 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:13,988 INFO L93 Difference]: Finished difference Result 1181 states and 4185 transitions. [2020-01-16 18:40:13,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:13,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:13,991 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:13,992 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:13,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:40:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:14,011 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:14,011 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:14,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:14,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:14,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:14,013 INFO L426 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1502753947, now seen corresponding path program 1007 times [2020-01-16 18:40:14,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:14,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468037980] [2020-01-16 18:40:14,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:14,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468037980] [2020-01-16 18:40:14,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:14,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:14,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929306133] [2020-01-16 18:40:14,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:14,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:14,381 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:14,523 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-01-16 18:40:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:14,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:14,527 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:40:14,527 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:40:14,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:40:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-01-16 18:40:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:14,547 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:14,547 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:14,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:14,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:14,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:14,548 INFO L426 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash 646042589, now seen corresponding path program 1008 times [2020-01-16 18:40:14,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:14,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227735855] [2020-01-16 18:40:14,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:14,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227735855] [2020-01-16 18:40:14,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:14,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:14,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272787183] [2020-01-16 18:40:14,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:14,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:14,913 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:15,075 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-01-16 18:40:15,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:15,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:15,079 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:40:15,079 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:40:15,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:40:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-01-16 18:40:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:40:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:40:15,099 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:40:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:15,099 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:40:15,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:40:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:15,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:15,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:15,100 INFO L426 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1316337409, now seen corresponding path program 1009 times [2020-01-16 18:40:15,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:15,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519787117] [2020-01-16 18:40:15,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:15,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519787117] [2020-01-16 18:40:15,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:15,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:15,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312032359] [2020-01-16 18:40:15,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:15,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:15,463 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:40:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:15,593 INFO L93 Difference]: Finished difference Result 1205 states and 4258 transitions. [2020-01-16 18:40:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:15,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:15,597 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:40:15,597 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:40:15,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:40:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-01-16 18:40:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:40:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-01-16 18:40:15,616 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-01-16 18:40:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:15,617 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-01-16 18:40:15,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-01-16 18:40:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:15,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:15,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:15,618 INFO L426 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash -346085795, now seen corresponding path program 1010 times [2020-01-16 18:40:15,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:15,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703454829] [2020-01-16 18:40:15,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:15,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703454829] [2020-01-16 18:40:15,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:15,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:15,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237452948] [2020-01-16 18:40:15,996 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:15,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:15,997 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:40:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:16,141 INFO L93 Difference]: Finished difference Result 1207 states and 4258 transitions. [2020-01-16 18:40:16,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:16,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:16,145 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:40:16,145 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:40:16,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:40:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-01-16 18:40:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:40:16,165 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:40:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:16,165 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:40:16,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:40:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:16,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:16,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:16,166 INFO L426 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash 166797529, now seen corresponding path program 1011 times [2020-01-16 18:40:16,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649691443] [2020-01-16 18:40:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:16,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649691443] [2020-01-16 18:40:16,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:16,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:16,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097122164] [2020-01-16 18:40:16,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:16,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:16,531 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:40:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:16,659 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:40:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:16,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:16,663 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:40:16,663 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:40:16,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:40:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 781. [2020-01-16 18:40:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:40:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:40:16,683 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:40:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:16,684 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:40:16,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:40:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:16,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:16,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:16,685 INFO L426 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1168558455, now seen corresponding path program 1012 times [2020-01-16 18:40:16,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:16,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574738163] [2020-01-16 18:40:16,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:17,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574738163] [2020-01-16 18:40:17,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:17,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:17,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132164353] [2020-01-16 18:40:17,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:17,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:17,057 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:40:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:17,221 INFO L93 Difference]: Finished difference Result 1205 states and 4250 transitions. [2020-01-16 18:40:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:17,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:17,225 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:40:17,225 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:40:17,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:40:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-01-16 18:40:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:40:17,246 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:40:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:17,246 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:40:17,246 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:40:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:17,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:17,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:17,248 INFO L426 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash 643731839, now seen corresponding path program 1013 times [2020-01-16 18:40:17,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:17,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97771541] [2020-01-16 18:40:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:17,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97771541] [2020-01-16 18:40:17,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:17,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:17,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75203104] [2020-01-16 18:40:17,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:17,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:17,622 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:40:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:17,764 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-01-16 18:40:17,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:17,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:17,768 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:40:17,768 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:40:17,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:40:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 782. [2020-01-16 18:40:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:40:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3106 transitions. [2020-01-16 18:40:17,788 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3106 transitions. Word has length 25 [2020-01-16 18:40:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:17,789 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3106 transitions. [2020-01-16 18:40:17,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3106 transitions. [2020-01-16 18:40:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:17,790 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:17,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:17,790 INFO L426 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1181587417, now seen corresponding path program 1014 times [2020-01-16 18:40:17,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:17,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752993972] [2020-01-16 18:40:17,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:18,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752993972] [2020-01-16 18:40:18,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:18,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:18,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347645256] [2020-01-16 18:40:18,175 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:18,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:18,175 INFO L87 Difference]: Start difference. First operand 782 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:40:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:18,314 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-01-16 18:40:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:18,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:18,317 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:40:18,317 INFO L226 Difference]: Without dead ends: 1185 [2020-01-16 18:40:18,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-01-16 18:40:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 773. [2020-01-16 18:40:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:40:18,338 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:40:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:18,338 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:40:18,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:40:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:18,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:18,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:18,339 INFO L426 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2133658435, now seen corresponding path program 1015 times [2020-01-16 18:40:18,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:18,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70964320] [2020-01-16 18:40:18,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:18,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-01-16 18:40:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70964320] [2020-01-16 18:40:18,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:18,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:18,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893172652] [2020-01-16 18:40:18,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:18,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:18,695 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:40:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:18,854 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-01-16 18:40:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:18,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:18,857 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:40:18,857 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:40:18,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:40:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:40:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:40:18,877 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:40:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:18,877 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:40:18,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:40:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:18,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:18,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:18,878 INFO L426 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1191057247, now seen corresponding path program 1016 times [2020-01-16 18:40:18,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:18,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680598321] [2020-01-16 18:40:18,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:19,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680598321] [2020-01-16 18:40:19,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:19,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:19,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588657377] [2020-01-16 18:40:19,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:19,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:19,231 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:40:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:19,382 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-01-16 18:40:19,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:19,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:19,385 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:40:19,385 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:40:19,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:40:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:40:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:40:19,404 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:40:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:19,405 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:40:19,405 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:40:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:19,406 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:19,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:19,406 INFO L426 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1121073063, now seen corresponding path program 1017 times [2020-01-16 18:40:19,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:19,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471676506] [2020-01-16 18:40:19,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:19,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-01-16 18:40:19,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471676506] [2020-01-16 18:40:19,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:19,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:19,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622651444] [2020-01-16 18:40:19,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:19,766 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:40:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:19,897 INFO L93 Difference]: Finished difference Result 1189 states and 4211 transitions. [2020-01-16 18:40:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:19,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:19,901 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:19,901 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:19,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:40:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:40:19,921 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:19,921 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:40:19,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:40:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:19,922 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:19,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:19,922 INFO L426 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -98305929, now seen corresponding path program 1018 times [2020-01-16 18:40:19,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:19,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359587747] [2020-01-16 18:40:19,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:20,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359587747] [2020-01-16 18:40:20,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:20,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:20,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867981451] [2020-01-16 18:40:20,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:20,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:20,295 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:20,464 INFO L93 Difference]: Finished difference Result 1187 states and 4205 transitions. [2020-01-16 18:40:20,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:20,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:20,467 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:20,467 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:40:20,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:40:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:40:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:40:20,487 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:20,487 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:40:20,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:40:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:20,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:20,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:20,488 INFO L426 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 449952835, now seen corresponding path program 1019 times [2020-01-16 18:40:20,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:20,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187052619] [2020-01-16 18:40:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:20,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187052619] [2020-01-16 18:40:20,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:20,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:20,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257868056] [2020-01-16 18:40:20,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:20,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:20,834 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:20,973 INFO L93 Difference]: Finished difference Result 1193 states and 4217 transitions. [2020-01-16 18:40:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:20,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:20,976 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:20,976 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:40:20,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:40:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:40:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:40:20,996 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:20,997 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:40:20,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:40:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:20,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:20,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:20,998 INFO L426 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash -85276967, now seen corresponding path program 1020 times [2020-01-16 18:40:20,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:20,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336837285] [2020-01-16 18:40:20,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336837285] [2020-01-16 18:40:21,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:21,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:21,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844923843] [2020-01-16 18:40:21,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:21,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:21,348 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:21,530 INFO L93 Difference]: Finished difference Result 1189 states and 4207 transitions. [2020-01-16 18:40:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:21,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:21,534 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:21,534 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:40:21,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:40:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-01-16 18:40:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:40:21,554 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:40:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:21,554 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:40:21,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:40:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:21,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:21,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] [2020-01-16 18:40:21,555 INFO L426 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1945631101, now seen corresponding path program 1021 times [2020-01-16 18:40:21,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:21,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498729490] [2020-01-16 18:40:21,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:21,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-01-16 18:40:21,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498729490] [2020-01-16 18:40:21,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:21,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:21,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733662364] [2020-01-16 18:40:21,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:21,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:21,923 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:40:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:22,071 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:40:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:22,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:22,074 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:22,074 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:40:22,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:40:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-01-16 18:40:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:40:22,094 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:40:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:22,094 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:40:22,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:40:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:22,095 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:22,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:22,095 INFO L426 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash -943870175, now seen corresponding path program 1022 times [2020-01-16 18:40:22,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:22,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096193358] [2020-01-16 18:40:22,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:22,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096193358] [2020-01-16 18:40:22,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:22,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:22,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881295466] [2020-01-16 18:40:22,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:22,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:22,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:22,471 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:40:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:22,653 INFO L93 Difference]: Finished difference Result 1194 states and 4219 transitions. [2020-01-16 18:40:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:22,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:22,656 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:40:22,657 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:22,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:40:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:40:22,677 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:22,677 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:40:22,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:40:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:22,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:22,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:22,678 INFO L426 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1906437055, now seen corresponding path program 1023 times [2020-01-16 18:40:22,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:22,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555770731] [2020-01-16 18:40:22,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:23,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-01-16 18:40:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555770731] [2020-01-16 18:40:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321735509] [2020-01-16 18:40:23,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:23,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:23,040 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:23,180 INFO L93 Difference]: Finished difference Result 1188 states and 4207 transitions. [2020-01-16 18:40:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:23,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:23,182 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:40:23,182 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:40:23,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:40:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:40:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:40:23,202 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:23,202 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:40:23,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:40:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:23,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:23,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:23,204 INFO L426 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1365763107, now seen corresponding path program 1024 times [2020-01-16 18:40:23,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:23,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264677014] [2020-01-16 18:40:23,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:23,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264677014] [2020-01-16 18:40:23,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:23,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:23,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475584913] [2020-01-16 18:40:23,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:23,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:23,560 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:23,730 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-01-16 18:40:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:23,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:23,733 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:23,733 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:40:23,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:40:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:40:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:23,753 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:23,753 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:23,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:23,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:23,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:23,754 INFO L426 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:23,755 INFO L82 PathProgramCache]: Analyzing trace with hash 697139907, now seen corresponding path program 1025 times [2020-01-16 18:40:23,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:23,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448212516] [2020-01-16 18:40:23,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:24,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-01-16 18:40:24,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448212516] [2020-01-16 18:40:24,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:24,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:24,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660763703] [2020-01-16 18:40:24,103 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:24,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:24,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:24,104 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:24,250 INFO L93 Difference]: Finished difference Result 1190 states and 4209 transitions. [2020-01-16 18:40:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:24,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:24,253 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:40:24,253 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:24,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:40:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:24,273 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:24,273 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:24,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:24,274 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:24,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:24,275 INFO L426 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash -375945473, now seen corresponding path program 1026 times [2020-01-16 18:40:24,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:24,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552842519] [2020-01-16 18:40:24,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:24,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552842519] [2020-01-16 18:40:24,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:24,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:24,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654724100] [2020-01-16 18:40:24,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:24,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:24,646 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:24,814 INFO L93 Difference]: Finished difference Result 1187 states and 4201 transitions. [2020-01-16 18:40:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:24,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:24,818 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:24,818 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:24,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:40:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:40:24,838 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:40:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:24,838 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:40:24,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:40:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:24,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:24,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:24,840 INFO L426 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash -24563171, now seen corresponding path program 1027 times [2020-01-16 18:40:24,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:24,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908377692] [2020-01-16 18:40:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:25,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908377692] [2020-01-16 18:40:25,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:25,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:25,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045518849] [2020-01-16 18:40:25,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:25,199 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:40:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:25,376 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-01-16 18:40:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:25,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:25,379 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:40:25,379 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:40:25,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:40:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-01-16 18:40:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:40:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:40:25,399 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:40:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:25,399 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:40:25,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:40:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:25,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:25,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:25,401 INFO L426 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash 513292407, now seen corresponding path program 1028 times [2020-01-16 18:40:25,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:25,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995621307] [2020-01-16 18:40:25,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:25,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995621307] [2020-01-16 18:40:25,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:25,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:25,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834641254] [2020-01-16 18:40:25,760 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:25,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:25,760 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:40:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:25,896 INFO L93 Difference]: Finished difference Result 1200 states and 4230 transitions. [2020-01-16 18:40:25,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:25,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:25,899 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:40:25,900 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:40:25,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:40:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:40:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:25,919 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:25,919 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:25,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:25,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:25,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:25,921 INFO L426 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1069528417, now seen corresponding path program 1029 times [2020-01-16 18:40:25,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:25,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663824388] [2020-01-16 18:40:25,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:26,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-01-16 18:40:26,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663824388] [2020-01-16 18:40:26,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:26,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:26,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938296151] [2020-01-16 18:40:26,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:26,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:26,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:26,264 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:26,443 INFO L93 Difference]: Finished difference Result 1195 states and 4220 transitions. [2020-01-16 18:40:26,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:26,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:26,447 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:40:26,447 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:40:26,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:40:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:40:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:26,467 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:26,467 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:26,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:26,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:26,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:26,469 INFO L426 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash 534298615, now seen corresponding path program 1030 times [2020-01-16 18:40:26,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:26,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904756424] [2020-01-16 18:40:26,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:26,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904756424] [2020-01-16 18:40:26,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:26,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:26,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676633525] [2020-01-16 18:40:26,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:26,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:26,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:26,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:26,828 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:27,010 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-01-16 18:40:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:27,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:27,013 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:40:27,013 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:40:27,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:40:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:40:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:40:27,033 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:40:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:27,033 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:40:27,033 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:40:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:27,034 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:27,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:27,034 INFO L426 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1101037729, now seen corresponding path program 1031 times [2020-01-16 18:40:27,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:27,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516565985] [2020-01-16 18:40:27,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:27,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516565985] [2020-01-16 18:40:27,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386863014] [2020-01-16 18:40:27,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:27,401 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:40:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:27,605 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:40:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:27,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:27,608 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:27,608 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:40:27,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:40:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-01-16 18:40:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:40:27,632 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:27,632 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:40:27,632 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:40:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:27,633 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:27,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:27,633 INFO L426 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 27952349, now seen corresponding path program 1032 times [2020-01-16 18:40:27,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888797523] [2020-01-16 18:40:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:27,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888797523] [2020-01-16 18:40:27,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:27,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:27,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814171249] [2020-01-16 18:40:27,986 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:27,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:27,986 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:28,172 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-01-16 18:40:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:28,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:28,176 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:40:28,176 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:40:28,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:40:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2020-01-16 18:40:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:40:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:40:28,195 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:40:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:28,196 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:40:28,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:40:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:28,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:28,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:28,197 INFO L426 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash -24944675, now seen corresponding path program 1033 times [2020-01-16 18:40:28,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:28,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490795705] [2020-01-16 18:40:28,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:28,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-01-16 18:40:28,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490795705] [2020-01-16 18:40:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:28,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388926200] [2020-01-16 18:40:28,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:28,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:28,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:28,586 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:40:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:28,761 INFO L93 Difference]: Finished difference Result 1187 states and 4209 transitions. [2020-01-16 18:40:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:28,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:28,764 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:28,764 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:40:28,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:40:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-01-16 18:40:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:40:28,784 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:40:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:28,785 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:40:28,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:40:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:28,786 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:28,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:28,786 INFO L426 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash 955810043, now seen corresponding path program 1034 times [2020-01-16 18:40:28,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:28,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718974400] [2020-01-16 18:40:28,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:29,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718974400] [2020-01-16 18:40:29,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:29,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:29,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016046786] [2020-01-16 18:40:29,166 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:29,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:29,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:29,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:29,166 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:40:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:29,345 INFO L93 Difference]: Finished difference Result 1186 states and 4204 transitions. [2020-01-16 18:40:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:29,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:29,348 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:29,348 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:40:29,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:40:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 776. [2020-01-16 18:40:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:40:29,369 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:29,369 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:40:29,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:40:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:29,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:29,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:29,370 INFO L426 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash -467843815, now seen corresponding path program 1035 times [2020-01-16 18:40:29,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:29,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920695518] [2020-01-16 18:40:29,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:29,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-01-16 18:40:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920695518] [2020-01-16 18:40:29,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:29,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:29,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837077412] [2020-01-16 18:40:29,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:29,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:29,745 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:29,921 INFO L93 Difference]: Finished difference Result 1190 states and 4213 transitions. [2020-01-16 18:40:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:29,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:29,924 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:40:29,924 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:40:29,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:40:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 780. [2020-01-16 18:40:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:40:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:40:29,945 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:40:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:29,945 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:40:29,945 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:40:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:29,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:29,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:29,946 INFO L426 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 533917111, now seen corresponding path program 1036 times [2020-01-16 18:40:29,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:29,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087864708] [2020-01-16 18:40:29,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:30,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087864708] [2020-01-16 18:40:30,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:30,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:30,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384544436] [2020-01-16 18:40:30,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:30,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:30,324 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:40:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:30,470 INFO L93 Difference]: Finished difference Result 1191 states and 4211 transitions. [2020-01-16 18:40:30,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:30,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:30,473 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:40:30,473 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:40:30,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:40:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-01-16 18:40:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:40:30,493 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:40:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:30,494 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:40:30,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:40:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:30,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:30,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:30,495 INFO L426 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1945627677, now seen corresponding path program 1037 times [2020-01-16 18:40:30,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:30,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254992917] [2020-01-16 18:40:30,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:30,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254992917] [2020-01-16 18:40:30,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:30,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:30,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988740045] [2020-01-16 18:40:30,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:30,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:30,864 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:40:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:31,039 INFO L93 Difference]: Finished difference Result 1187 states and 4203 transitions. [2020-01-16 18:40:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:31,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:31,042 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:31,042 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:40:31,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:40:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-01-16 18:40:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:40:31,062 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:31,062 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:40:31,062 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:40:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:31,063 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:31,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:31,063 INFO L426 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 872542297, now seen corresponding path program 1038 times [2020-01-16 18:40:31,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:31,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637848404] [2020-01-16 18:40:31,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:31,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637848404] [2020-01-16 18:40:31,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:31,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:31,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948888504] [2020-01-16 18:40:31,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:31,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:31,437 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:31,612 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-01-16 18:40:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:31,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:31,615 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:31,615 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:31,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 773. [2020-01-16 18:40:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:40:31,635 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:40:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:31,636 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:40:31,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:40:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:31,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:31,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:31,637 INFO L426 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash -869916127, now seen corresponding path program 1039 times [2020-01-16 18:40:31,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:31,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929935918] [2020-01-16 18:40:31,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:32,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-01-16 18:40:32,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929935918] [2020-01-16 18:40:32,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:32,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:32,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428591329] [2020-01-16 18:40:32,011 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:32,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:32,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:32,011 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:40:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:32,186 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:40:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:32,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:32,189 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:40:32,190 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:40:32,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:40:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2020-01-16 18:40:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:40:32,211 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:32,211 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:40:32,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:40:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:32,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:32,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:32,212 INFO L426 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash 110838591, now seen corresponding path program 1040 times [2020-01-16 18:40:32,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:32,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402953824] [2020-01-16 18:40:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:32,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402953824] [2020-01-16 18:40:32,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:32,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:32,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266882660] [2020-01-16 18:40:32,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:32,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:32,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:32,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:32,594 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:32,729 INFO L93 Difference]: Finished difference Result 1179 states and 4183 transitions. [2020-01-16 18:40:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:32,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:32,732 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:40:32,732 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:40:32,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:40:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:40:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:40:32,752 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:32,752 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:40:32,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:40:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:32,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:32,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:32,754 INFO L426 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1755714407, now seen corresponding path program 1041 times [2020-01-16 18:40:32,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425066960] [2020-01-16 18:40:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:33,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425066960] [2020-01-16 18:40:33,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:33,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:33,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135246926] [2020-01-16 18:40:33,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:33,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:33,127 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:33,303 INFO L93 Difference]: Finished difference Result 1178 states and 4181 transitions. [2020-01-16 18:40:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:33,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:33,306 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:40:33,306 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:33,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:40:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:40:33,327 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:33,327 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:40:33,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:40:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:33,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:33,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:33,329 INFO L426 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash -732947273, now seen corresponding path program 1042 times [2020-01-16 18:40:33,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:33,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803699358] [2020-01-16 18:40:33,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:33,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-01-16 18:40:33,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803699358] [2020-01-16 18:40:33,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:33,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138283332] [2020-01-16 18:40:33,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:33,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:33,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:33,695 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:33,824 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:40:33,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:33,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:33,828 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:40:33,828 INFO L226 Difference]: Without dead ends: 1163 [2020-01-16 18:40:33,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-01-16 18:40:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-01-16 18:40:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:33,849 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:33,849 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:33,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:33,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:33,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:33,850 INFO L426 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848673, now seen corresponding path program 1043 times [2020-01-16 18:40:33,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717386827] [2020-01-16 18:40:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:34,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-01-16 18:40:34,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717386827] [2020-01-16 18:40:34,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:34,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:34,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541957470] [2020-01-16 18:40:34,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:34,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:34,236 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:34,372 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:40:34,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:34,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:34,375 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:40:34,376 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:40:34,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:40:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 777. [2020-01-16 18:40:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:34,396 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:34,396 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:34,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:34,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:34,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:34,397 INFO L426 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash -394322087, now seen corresponding path program 1044 times [2020-01-16 18:40:34,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:34,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176974676] [2020-01-16 18:40:34,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:34,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176974676] [2020-01-16 18:40:34,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:34,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022722766] [2020-01-16 18:40:34,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:34,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:34,767 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:34,890 INFO L93 Difference]: Finished difference Result 1175 states and 4171 transitions. [2020-01-16 18:40:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:34,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:34,893 INFO L225 Difference]: With dead ends: 1175 [2020-01-16 18:40:34,894 INFO L226 Difference]: Without dead ends: 1160 [2020-01-16 18:40:34,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-01-16 18:40:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 773. [2020-01-16 18:40:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:40:34,914 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:40:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:34,914 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:40:34,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:40:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:34,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:34,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:34,915 INFO L426 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2137180577, now seen corresponding path program 1045 times [2020-01-16 18:40:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:34,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197901631] [2020-01-16 18:40:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:35,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197901631] [2020-01-16 18:40:35,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:35,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:35,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118147136] [2020-01-16 18:40:35,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:35,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:35,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:35,285 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:40:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:35,415 INFO L93 Difference]: Finished difference Result 1186 states and 4200 transitions. [2020-01-16 18:40:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:35,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:35,418 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:35,418 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:40:35,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:40:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 779. [2020-01-16 18:40:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:40:35,438 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:35,438 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:40:35,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:40:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:35,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:35,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:35,440 INFO L426 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025793, now seen corresponding path program 1046 times [2020-01-16 18:40:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:35,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446309453] [2020-01-16 18:40:35,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:35,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-01-16 18:40:35,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446309453] [2020-01-16 18:40:35,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:35,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:35,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201362204] [2020-01-16 18:40:35,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:35,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:35,821 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:35,942 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-01-16 18:40:35,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:35,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:35,945 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:35,946 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:35,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:40:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:35,966 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:35,966 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:35,966 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:35,967 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:35,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:35,967 INFO L426 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1694281437, now seen corresponding path program 1047 times [2020-01-16 18:40:35,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:35,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815444414] [2020-01-16 18:40:35,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:36,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-01-16 18:40:36,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815444414] [2020-01-16 18:40:36,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:36,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:36,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783165534] [2020-01-16 18:40:36,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:36,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:36,330 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:36,455 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:40:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:36,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:36,458 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:36,458 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:36,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:40:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:36,478 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:36,478 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:36,478 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:36,479 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:36,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:36,479 INFO L426 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1577918725, now seen corresponding path program 1048 times [2020-01-16 18:40:36,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:36,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587457507] [2020-01-16 18:40:36,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:36,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587457507] [2020-01-16 18:40:36,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:36,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:36,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392707944] [2020-01-16 18:40:36,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:36,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:36,848 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:36,995 INFO L93 Difference]: Finished difference Result 1179 states and 4180 transitions. [2020-01-16 18:40:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:36,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:36,999 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:40:36,999 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:40:36,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:40:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:40:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:40:37,019 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:40:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:37,019 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:40:37,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:40:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:37,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:37,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] [2020-01-16 18:40:37,020 INFO L426 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:37,021 INFO L82 PathProgramCache]: Analyzing trace with hash 484984289, now seen corresponding path program 1049 times [2020-01-16 18:40:37,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:37,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629252717] [2020-01-16 18:40:37,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:37,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629252717] [2020-01-16 18:40:37,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:37,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:37,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280475791] [2020-01-16 18:40:37,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:37,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:37,393 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:40:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:37,514 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:40:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:37,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:37,517 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:40:37,517 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:37,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:40:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:40:37,537 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:37,537 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:40:37,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:40:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:37,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:37,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:37,538 INFO L426 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -588101091, now seen corresponding path program 1050 times [2020-01-16 18:40:37,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:37,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196870586] [2020-01-16 18:40:37,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:37,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-01-16 18:40:37,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196870586] [2020-01-16 18:40:37,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:37,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:37,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934618277] [2020-01-16 18:40:37,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:37,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:37,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:37,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:37,903 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:38,042 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:40:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:38,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:38,046 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:40:38,046 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:38,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:40:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:40:38,066 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:40:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:38,067 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:40:38,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:40:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:38,068 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:38,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:38,068 INFO L426 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1277332667, now seen corresponding path program 1051 times [2020-01-16 18:40:38,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:38,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136377399] [2020-01-16 18:40:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:38,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136377399] [2020-01-16 18:40:38,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:38,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:38,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458850381] [2020-01-16 18:40:38,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:38,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:38,430 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:40:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:38,553 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:40:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:38,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:38,556 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:38,556 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:38,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 778. [2020-01-16 18:40:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:40:38,576 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:38,577 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:40:38,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:40:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:38,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:38,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:38,578 INFO L426 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash 204247287, now seen corresponding path program 1052 times [2020-01-16 18:40:38,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:38,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195516373] [2020-01-16 18:40:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:38,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195516373] [2020-01-16 18:40:38,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:38,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:38,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757405237] [2020-01-16 18:40:38,950 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:38,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:38,951 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:39,087 INFO L93 Difference]: Finished difference Result 1183 states and 4187 transitions. [2020-01-16 18:40:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:39,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:39,091 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:40:39,091 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:40:39,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:40:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:40:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:40:39,111 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:40:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:39,111 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:40:39,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:40:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:39,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:39,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:39,113 INFO L426 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1923543041, now seen corresponding path program 1053 times [2020-01-16 18:40:39,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:39,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27680193] [2020-01-16 18:40:39,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:39,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-01-16 18:40:39,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27680193] [2020-01-16 18:40:39,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:39,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:39,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615932789] [2020-01-16 18:40:39,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:39,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:39,473 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:40:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:39,595 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-01-16 18:40:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:39,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:39,598 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:40:39,598 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:39,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:40:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:40:39,619 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:39,619 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:40:39,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:40:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:39,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:39,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:39,620 INFO L426 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash 225253495, now seen corresponding path program 1054 times [2020-01-16 18:40:39,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:39,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649078321] [2020-01-16 18:40:39,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:40,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649078321] [2020-01-16 18:40:40,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:40,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:40,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669772721] [2020-01-16 18:40:40,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:40,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:40,003 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:40,145 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-01-16 18:40:40,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:40,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:40,148 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:40:40,148 INFO L226 Difference]: Without dead ends: 1163 [2020-01-16 18:40:40,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-01-16 18:40:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-01-16 18:40:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:40:40,177 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:40:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:40,177 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:40:40,178 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:40:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:40,179 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:40,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:40,179 INFO L426 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:40,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1902536833, now seen corresponding path program 1055 times [2020-01-16 18:40:40,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:40,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5073242] [2020-01-16 18:40:40,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:40,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5073242] [2020-01-16 18:40:40,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:40,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:40,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642125113] [2020-01-16 18:40:40,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:40,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:40,543 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:40:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:40,673 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-01-16 18:40:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:40,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:40,676 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:40,676 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:40:40,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:40:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-01-16 18:40:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:40:40,697 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:40:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:40,697 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:40:40,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:40:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:40,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:40,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:40,698 INFO L426 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1319345083, now seen corresponding path program 1056 times [2020-01-16 18:40:40,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:40,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183635472] [2020-01-16 18:40:40,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:41,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183635472] [2020-01-16 18:40:41,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:41,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:41,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297379883] [2020-01-16 18:40:41,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:41,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:41,066 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:40:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:41,194 INFO L93 Difference]: Finished difference Result 1178 states and 4173 transitions. [2020-01-16 18:40:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:41,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:41,197 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:40:41,197 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:40:41,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:40:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-01-16 18:40:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:40:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:40:41,217 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:40:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:41,217 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:40:41,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:40:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:41,218 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:41,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:41,218 INFO L426 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1231567229, now seen corresponding path program 1057 times [2020-01-16 18:40:41,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:41,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116632251] [2020-01-16 18:40:41,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:41,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116632251] [2020-01-16 18:40:41,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:41,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:41,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589097200] [2020-01-16 18:40:41,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:41,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:41,594 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:40:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:41,714 INFO L93 Difference]: Finished difference Result 1197 states and 4229 transitions. [2020-01-16 18:40:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:41,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:41,718 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:40:41,718 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:40:41,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:40:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:40:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:40:41,739 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:40:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:41,739 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:40:41,739 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:40:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:41,740 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:41,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] [2020-01-16 18:40:41,740 INFO L426 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 379373729, now seen corresponding path program 1058 times [2020-01-16 18:40:41,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:41,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940308876] [2020-01-16 18:40:41,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:42,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940308876] [2020-01-16 18:40:42,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:42,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:42,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945379615] [2020-01-16 18:40:42,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:42,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:42,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:42,106 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:40:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:42,228 INFO L93 Difference]: Finished difference Result 1194 states and 4220 transitions. [2020-01-16 18:40:42,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:42,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:42,231 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:40:42,232 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:40:42,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:40:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-01-16 18:40:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-01-16 18:40:42,252 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:42,252 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-01-16 18:40:42,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-01-16 18:40:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:42,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:42,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:42,254 INFO L426 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash -137475641, now seen corresponding path program 1059 times [2020-01-16 18:40:42,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:42,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183106456] [2020-01-16 18:40:42,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:42,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183106456] [2020-01-16 18:40:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:42,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:42,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704389357] [2020-01-16 18:40:42,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:42,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:42,620 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:40:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:42,739 INFO L93 Difference]: Finished difference Result 1201 states and 4236 transitions. [2020-01-16 18:40:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:42,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:42,742 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:40:42,742 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:40:42,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:40:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 781. [2020-01-16 18:40:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:40:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3103 transitions. [2020-01-16 18:40:42,762 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3103 transitions. Word has length 25 [2020-01-16 18:40:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:42,762 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3103 transitions. [2020-01-16 18:40:42,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3103 transitions. [2020-01-16 18:40:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:42,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:42,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:42,763 INFO L426 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash 400379937, now seen corresponding path program 1060 times [2020-01-16 18:40:42,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:42,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901239315] [2020-01-16 18:40:42,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:43,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901239315] [2020-01-16 18:40:43,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:43,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:43,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589306508] [2020-01-16 18:40:43,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:43,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:43,143 INFO L87 Difference]: Start difference. First operand 781 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:40:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:43,267 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:40:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:43,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:43,271 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:40:43,271 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:40:43,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:40:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-01-16 18:40:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:40:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-01-16 18:40:43,291 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-01-16 18:40:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:43,291 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-01-16 18:40:43,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-01-16 18:40:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:43,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:43,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:43,293 INFO L426 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -126972537, now seen corresponding path program 1061 times [2020-01-16 18:40:43,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:43,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137156408] [2020-01-16 18:40:43,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:43,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137156408] [2020-01-16 18:40:43,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:43,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:43,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597245423] [2020-01-16 18:40:43,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:43,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:43,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:43,646 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:40:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:43,773 INFO L93 Difference]: Finished difference Result 1193 states and 4215 transitions. [2020-01-16 18:40:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:43,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:43,776 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:40:43,776 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:40:43,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:40:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:40:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:40:43,797 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:43,797 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:40:43,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:40:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:43,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:43,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:43,798 INFO L426 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1200057917, now seen corresponding path program 1062 times [2020-01-16 18:40:43,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:43,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404556324] [2020-01-16 18:40:43,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:44,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404556324] [2020-01-16 18:40:44,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:44,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:44,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160041343] [2020-01-16 18:40:44,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:44,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:44,153 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:44,280 INFO L93 Difference]: Finished difference Result 1195 states and 4216 transitions. [2020-01-16 18:40:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:44,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:44,284 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:40:44,284 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:40:44,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:40:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-01-16 18:40:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:40:44,304 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:40:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:44,304 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:40:44,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:40:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:44,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:44,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:44,305 INFO L426 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1674466369, now seen corresponding path program 1063 times [2020-01-16 18:40:44,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:44,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305732878] [2020-01-16 18:40:44,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:44,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305732878] [2020-01-16 18:40:44,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:44,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:44,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165441618] [2020-01-16 18:40:44,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:44,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:44,668 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:40:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:44,790 INFO L93 Difference]: Finished difference Result 1189 states and 4205 transitions. [2020-01-16 18:40:44,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:44,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:44,793 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:44,793 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:40:44,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:40:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-01-16 18:40:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:40:44,814 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:40:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:44,814 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:40:44,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:40:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:44,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:44,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:44,815 INFO L426 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -63525411, now seen corresponding path program 1064 times [2020-01-16 18:40:44,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:44,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045319269] [2020-01-16 18:40:44,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:45,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-01-16 18:40:45,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045319269] [2020-01-16 18:40:45,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:45,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:45,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598375669] [2020-01-16 18:40:45,173 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:45,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:45,173 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:40:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:45,300 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-01-16 18:40:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:45,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:45,303 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:45,303 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:40:45,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:40:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:40:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:40:45,323 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:40:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:45,323 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:40:45,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:40:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:45,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:45,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:45,324 INFO L426 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 513716807, now seen corresponding path program 1065 times [2020-01-16 18:40:45,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:45,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289718334] [2020-01-16 18:40:45,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:45,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289718334] [2020-01-16 18:40:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:45,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893129926] [2020-01-16 18:40:45,684 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:45,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:45,685 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:40:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:45,806 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-01-16 18:40:45,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:45,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:45,809 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:45,809 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:45,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:40:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:40:45,830 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:45,830 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:40:45,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:40:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:45,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:45,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:45,831 INFO L426 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash -21512995, now seen corresponding path program 1066 times [2020-01-16 18:40:45,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:45,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492231459] [2020-01-16 18:40:45,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:46,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492231459] [2020-01-16 18:40:46,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:46,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:46,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926307396] [2020-01-16 18:40:46,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:46,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:46,185 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:46,333 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:40:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:46,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:46,337 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:40:46,337 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:40:46,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:40:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:40:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:40:46,357 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:40:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:46,357 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:40:46,357 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:40:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:46,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:46,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:46,359 INFO L426 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 524219911, now seen corresponding path program 1067 times [2020-01-16 18:40:46,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:46,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795077082] [2020-01-16 18:40:46,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:46,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795077082] [2020-01-16 18:40:46,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:46,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:46,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722293902] [2020-01-16 18:40:46,744 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:46,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:46,745 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:40:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:46,878 INFO L93 Difference]: Finished difference Result 1181 states and 4184 transitions. [2020-01-16 18:40:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:46,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:46,882 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:46,882 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:46,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:40:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:40:46,902 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:46,902 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:40:46,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:40:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:46,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:46,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:46,903 INFO L426 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1621950849, now seen corresponding path program 1068 times [2020-01-16 18:40:46,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:46,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666666974] [2020-01-16 18:40:46,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:47,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-01-16 18:40:47,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666666974] [2020-01-16 18:40:47,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:47,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:47,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276477975] [2020-01-16 18:40:47,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:47,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:47,268 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:47,401 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:40:47,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:47,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:47,404 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:40:47,404 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:40:47,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:40:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:40:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:40:47,424 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:40:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:47,424 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:40:47,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:40:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:47,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:47,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:47,425 INFO L426 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1023273921, now seen corresponding path program 1069 times [2020-01-16 18:40:47,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:47,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077147685] [2020-01-16 18:40:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:47,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077147685] [2020-01-16 18:40:47,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:47,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:47,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397949349] [2020-01-16 18:40:47,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:47,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:47,789 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:40:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:47,915 INFO L93 Difference]: Finished difference Result 1197 states and 4223 transitions. [2020-01-16 18:40:47,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:47,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:47,919 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:40:47,919 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:40:47,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:40:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 780. [2020-01-16 18:40:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:40:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-01-16 18:40:47,942 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:47,942 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-01-16 18:40:47,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-01-16 18:40:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:47,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:47,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:47,944 INFO L426 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -485418343, now seen corresponding path program 1070 times [2020-01-16 18:40:47,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:47,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735031137] [2020-01-16 18:40:47,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:48,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735031137] [2020-01-16 18:40:48,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:48,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:48,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23121907] [2020-01-16 18:40:48,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:48,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:48,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:48,323 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:48,449 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-01-16 18:40:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:48,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:48,452 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:40:48,452 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:40:48,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:40:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:40:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:40:48,472 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:40:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:48,472 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:40:48,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:40:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:48,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:48,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:48,474 INFO L426 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 70817667, now seen corresponding path program 1071 times [2020-01-16 18:40:48,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:48,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760219029] [2020-01-16 18:40:48,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:48,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-01-16 18:40:48,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760219029] [2020-01-16 18:40:48,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:48,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:48,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929689453] [2020-01-16 18:40:48,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:48,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:48,826 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:40:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:48,954 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-01-16 18:40:48,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:48,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:48,958 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:40:48,958 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:40:48,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:40:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:40:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:40:48,978 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:40:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:48,978 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:40:48,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:40:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:48,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:48,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:48,979 INFO L426 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash -464412135, now seen corresponding path program 1072 times [2020-01-16 18:40:48,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:48,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514662434] [2020-01-16 18:40:48,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:49,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514662434] [2020-01-16 18:40:49,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:49,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:49,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057287360] [2020-01-16 18:40:49,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:49,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:49,335 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:40:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:49,498 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-01-16 18:40:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:49,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:49,502 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:40:49,502 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:40:49,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:40:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:40:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:40:49,522 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:40:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:49,522 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:40:49,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:40:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:49,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:49,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:49,523 INFO L426 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 102326979, now seen corresponding path program 1073 times [2020-01-16 18:40:49,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:49,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573163758] [2020-01-16 18:40:49,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:49,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573163758] [2020-01-16 18:40:49,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:49,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:49,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996067882] [2020-01-16 18:40:49,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:49,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:49,880 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:40:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:50,007 INFO L93 Difference]: Finished difference Result 1189 states and 4200 transitions. [2020-01-16 18:40:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:50,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:50,010 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:40:50,010 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:40:50,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:40:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:40:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:40:50,030 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:40:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:50,030 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:40:50,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:40:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:50,031 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:50,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:50,031 INFO L426 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -970758401, now seen corresponding path program 1074 times [2020-01-16 18:40:50,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:50,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716268650] [2020-01-16 18:40:50,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:50,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716268650] [2020-01-16 18:40:50,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:50,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:50,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544527353] [2020-01-16 18:40:50,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:50,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:50,388 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:40:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:50,539 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-01-16 18:40:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:50,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:50,542 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:50,542 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:40:50,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:40:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:40:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:40:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:40:50,563 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:40:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:50,563 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:40:50,563 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:40:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:50,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:50,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:50,564 INFO L426 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 913263261, now seen corresponding path program 1075 times [2020-01-16 18:40:50,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:50,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908605523] [2020-01-16 18:40:50,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:50,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908605523] [2020-01-16 18:40:50,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:50,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:50,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248933861] [2020-01-16 18:40:50,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:50,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:50,934 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:40:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:51,058 INFO L93 Difference]: Finished difference Result 1184 states and 4191 transitions. [2020-01-16 18:40:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:51,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:51,062 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:40:51,062 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:40:51,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:40:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:40:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:40:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-01-16 18:40:51,082 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-01-16 18:40:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:51,082 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-01-16 18:40:51,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-01-16 18:40:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:51,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:51,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:51,083 INFO L426 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash -159822119, now seen corresponding path program 1076 times [2020-01-16 18:40:51,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:51,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500780290] [2020-01-16 18:40:51,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:51,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500780290] [2020-01-16 18:40:51,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:51,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:51,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176104441] [2020-01-16 18:40:51,466 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:51,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:51,467 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:40:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:51,593 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-01-16 18:40:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:51,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:51,596 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:40:51,597 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:40:51,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:40:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:40:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:40:51,617 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:40:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:51,617 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:40:51,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:40:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:51,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:51,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:51,618 INFO L426 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2007354849, now seen corresponding path program 1077 times [2020-01-16 18:40:51,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:51,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924661684] [2020-01-16 18:40:51,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:51,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924661684] [2020-01-16 18:40:51,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:51,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:51,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254115391] [2020-01-16 18:40:51,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:51,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:51,981 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:40:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:52,104 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:40:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:52,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:52,107 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:40:52,107 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:40:52,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:40:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:40:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:40:52,126 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:40:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:52,126 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:40:52,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:40:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:52,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:52,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:52,128 INFO L426 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -138815911, now seen corresponding path program 1078 times [2020-01-16 18:40:52,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:52,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290502301] [2020-01-16 18:40:52,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:52,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290502301] [2020-01-16 18:40:52,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:52,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:52,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996423923] [2020-01-16 18:40:52,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:52,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:52,503 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:40:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:52,649 INFO L93 Difference]: Finished difference Result 1179 states and 4176 transitions. [2020-01-16 18:40:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:52,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:52,652 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:40:52,652 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:40:52,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:40:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:40:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:40:52,672 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:40:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:52,672 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:40:52,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:40:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:52,673 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:52,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:52,674 INFO L426 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2028361057, now seen corresponding path program 1079 times [2020-01-16 18:40:52,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:52,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632279082] [2020-01-16 18:40:52,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:53,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632279082] [2020-01-16 18:40:53,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:53,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:53,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186220822] [2020-01-16 18:40:53,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:53,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:53,034 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:40:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:53,164 INFO L93 Difference]: Finished difference Result 1184 states and 4186 transitions. [2020-01-16 18:40:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:53,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:53,167 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:40:53,167 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:40:53,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:40:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:40:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:40:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:40:53,188 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:40:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:53,188 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:40:53,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:40:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:53,189 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:53,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:53,189 INFO L426 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 955275677, now seen corresponding path program 1080 times [2020-01-16 18:40:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:53,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826313507] [2020-01-16 18:40:53,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:53,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826313507] [2020-01-16 18:40:53,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:53,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:53,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018120802] [2020-01-16 18:40:53,551 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:53,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:53,552 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:40:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:53,697 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-01-16 18:40:53,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:53,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:53,701 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:40:53,701 INFO L226 Difference]: Without dead ends: 1162 [2020-01-16 18:40:53,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-01-16 18:40:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 769. [2020-01-16 18:40:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:40:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3072 transitions. [2020-01-16 18:40:53,731 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3072 transitions. Word has length 25 [2020-01-16 18:40:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:53,732 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3072 transitions. [2020-01-16 18:40:53,732 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3072 transitions. [2020-01-16 18:40:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:53,733 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:53,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:53,733 INFO L426 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1755725605, now seen corresponding path program 1081 times [2020-01-16 18:40:53,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:53,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546454349] [2020-01-16 18:40:53,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:54,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546454349] [2020-01-16 18:40:54,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:54,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:54,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886004932] [2020-01-16 18:40:54,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:54,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:54,089 INFO L87 Difference]: Start difference. First operand 769 states and 3072 transitions. Second operand 10 states. [2020-01-16 18:40:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:54,219 INFO L93 Difference]: Finished difference Result 1246 states and 4389 transitions. [2020-01-16 18:40:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:54,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:54,222 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:40:54,222 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:40:54,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:40:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 783. [2020-01-16 18:40:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:40:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-01-16 18:40:54,242 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-01-16 18:40:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:54,242 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-01-16 18:40:54,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-01-16 18:40:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:54,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:54,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:54,243 INFO L426 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1568990077, now seen corresponding path program 1082 times [2020-01-16 18:40:54,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:54,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315057809] [2020-01-16 18:40:54,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:54,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315057809] [2020-01-16 18:40:54,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:54,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:54,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286073308] [2020-01-16 18:40:54,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:54,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:54,598 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:40:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:54,724 INFO L93 Difference]: Finished difference Result 1248 states and 4389 transitions. [2020-01-16 18:40:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:54,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:54,727 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:40:54,727 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:40:54,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:40:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 779. [2020-01-16 18:40:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-01-16 18:40:54,746 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-01-16 18:40:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:54,747 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-01-16 18:40:54,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-01-16 18:40:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:54,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:54,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:54,748 INFO L426 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1312826465, now seen corresponding path program 1083 times [2020-01-16 18:40:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:54,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792415206] [2020-01-16 18:40:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:55,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-01-16 18:40:55,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792415206] [2020-01-16 18:40:55,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:55,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:55,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009108536] [2020-01-16 18:40:55,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:55,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:55,105 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:40:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:55,238 INFO L93 Difference]: Finished difference Result 1247 states and 4387 transitions. [2020-01-16 18:40:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:55,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:55,241 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:40:55,241 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:40:55,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:40:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-01-16 18:40:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:40:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-01-16 18:40:55,261 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-01-16 18:40:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:55,261 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-01-16 18:40:55,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-01-16 18:40:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:55,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:55,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:55,263 INFO L426 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1990883009, now seen corresponding path program 1084 times [2020-01-16 18:40:55,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:55,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857706449] [2020-01-16 18:40:55,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:55,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857706449] [2020-01-16 18:40:55,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:55,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:55,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600456039] [2020-01-16 18:40:55,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:55,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:55,623 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:40:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:55,787 INFO L93 Difference]: Finished difference Result 1250 states and 4389 transitions. [2020-01-16 18:40:55,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:55,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:55,790 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:40:55,790 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:40:55,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:40:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-01-16 18:40:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-01-16 18:40:55,810 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-01-16 18:40:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:55,811 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-01-16 18:40:55,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-01-16 18:40:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:55,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:55,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:55,812 INFO L426 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash -904768667, now seen corresponding path program 1085 times [2020-01-16 18:40:55,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:55,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137619417] [2020-01-16 18:40:55,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:56,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137619417] [2020-01-16 18:40:56,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:56,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:56,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087140653] [2020-01-16 18:40:56,165 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:56,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:56,166 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:40:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:56,295 INFO L93 Difference]: Finished difference Result 1253 states and 4397 transitions. [2020-01-16 18:40:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:56,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:56,298 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:40:56,298 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:40:56,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:40:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 785. [2020-01-16 18:40:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:40:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-01-16 18:40:56,318 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-01-16 18:40:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:56,318 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-01-16 18:40:56,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-01-16 18:40:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:56,320 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:56,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:56,320 INFO L426 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1977854047, now seen corresponding path program 1086 times [2020-01-16 18:40:56,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:56,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295032492] [2020-01-16 18:40:56,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:56,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-01-16 18:40:56,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295032492] [2020-01-16 18:40:56,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:56,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:56,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483579914] [2020-01-16 18:40:56,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:56,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:56,695 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:40:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:56,823 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-01-16 18:40:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:56,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:56,827 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:40:56,827 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:40:56,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:40:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 775. [2020-01-16 18:40:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3098 transitions. [2020-01-16 18:40:56,848 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3098 transitions. Word has length 25 [2020-01-16 18:40:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:56,848 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3098 transitions. [2020-01-16 18:40:56,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3098 transitions. [2020-01-16 18:40:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:56,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:56,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:56,849 INFO L426 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1333239879, now seen corresponding path program 1087 times [2020-01-16 18:40:56,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:56,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981631467] [2020-01-16 18:40:56,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:57,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981631467] [2020-01-16 18:40:57,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:57,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:57,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076866058] [2020-01-16 18:40:57,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:57,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:57,206 INFO L87 Difference]: Start difference. First operand 775 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:40:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:57,334 INFO L93 Difference]: Finished difference Result 1243 states and 4378 transitions. [2020-01-16 18:40:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:57,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:57,338 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:40:57,338 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:40:57,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:40:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:40:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:40:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-01-16 18:40:57,358 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-01-16 18:40:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:57,358 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-01-16 18:40:57,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-01-16 18:40:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:57,359 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:57,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:57,359 INFO L426 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1991475803, now seen corresponding path program 1088 times [2020-01-16 18:40:57,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:57,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953449688] [2020-01-16 18:40:57,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:57,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-01-16 18:40:57,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953449688] [2020-01-16 18:40:57,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:57,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:57,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068134075] [2020-01-16 18:40:57,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:57,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:57,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:57,715 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:40:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:57,852 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-01-16 18:40:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:57,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:57,856 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:40:57,856 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:40:57,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:40:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:40:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-01-16 18:40:57,876 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-01-16 18:40:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:57,876 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-01-16 18:40:57,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-01-16 18:40:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:57,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:57,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] [2020-01-16 18:40:57,877 INFO L426 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1478592479, now seen corresponding path program 1089 times [2020-01-16 18:40:57,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:57,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121400357] [2020-01-16 18:40:57,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:58,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121400357] [2020-01-16 18:40:58,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:58,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361552532] [2020-01-16 18:40:58,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:58,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:58,237 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:40:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:58,355 INFO L93 Difference]: Finished difference Result 1242 states and 4372 transitions. [2020-01-16 18:40:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:58,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:58,359 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:40:58,359 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:40:58,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:40:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-01-16 18:40:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:40:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:40:58,379 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:40:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:58,379 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:40:58,379 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:40:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:58,380 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:58,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:58,380 INFO L426 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -476831553, now seen corresponding path program 1090 times [2020-01-16 18:40:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:58,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552759982] [2020-01-16 18:40:58,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:58,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-01-16 18:40:58,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552759982] [2020-01-16 18:40:58,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:58,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340603390] [2020-01-16 18:40:58,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:58,739 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:40:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:58,887 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-01-16 18:40:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:58,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:58,891 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:40:58,891 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:40:58,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:40:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 779. [2020-01-16 18:40:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:40:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:40:58,912 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:40:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:58,912 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:40:58,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:40:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:58,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:58,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:58,914 INFO L426 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1001658169, now seen corresponding path program 1091 times [2020-01-16 18:40:58,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:58,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692802931] [2020-01-16 18:40:58,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692802931] [2020-01-16 18:40:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:59,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:59,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931351088] [2020-01-16 18:40:59,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:59,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:59,284 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:40:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:59,412 INFO L93 Difference]: Finished difference Result 1247 states and 4379 transitions. [2020-01-16 18:40:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:59,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:59,416 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:40:59,416 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:40:59,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:40:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 784. [2020-01-16 18:40:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:40:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-01-16 18:40:59,436 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-01-16 18:40:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:59,436 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-01-16 18:40:59,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-01-16 18:40:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:59,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:59,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:59,437 INFO L426 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -463802591, now seen corresponding path program 1092 times [2020-01-16 18:40:59,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:59,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575830689] [2020-01-16 18:40:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:40:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:40:59,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575830689] [2020-01-16 18:40:59,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:40:59,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:40:59,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144014964] [2020-01-16 18:40:59,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:40:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:40:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:40:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:40:59,805 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:40:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:40:59,930 INFO L93 Difference]: Finished difference Result 1246 states and 4372 transitions. [2020-01-16 18:40:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:40:59,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:40:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:40:59,934 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:40:59,934 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:40:59,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:40:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:40:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 775. [2020-01-16 18:40:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:40:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:40:59,954 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:40:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:40:59,955 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:40:59,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:40:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:40:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:40:59,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:40:59,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:40:59,956 INFO L426 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:40:59,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:40:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash 45369287, now seen corresponding path program 1093 times [2020-01-16 18:40:59,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:40:59,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148173367] [2020-01-16 18:40:59,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:40:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:00,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148173367] [2020-01-16 18:41:00,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:00,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:00,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173066726] [2020-01-16 18:41:00,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:00,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:00,315 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:41:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:00,458 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-01-16 18:41:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:00,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:00,461 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:41:00,461 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:41:00,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:41:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:41:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:41:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:41:00,481 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:41:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:00,481 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:41:00,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:41:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:00,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:00,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:00,482 INFO L426 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1036627109, now seen corresponding path program 1094 times [2020-01-16 18:41:00,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:00,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579209294] [2020-01-16 18:41:00,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:00,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579209294] [2020-01-16 18:41:00,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:00,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:00,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341396570] [2020-01-16 18:41:00,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:00,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:00,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:00,838 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:41:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:00,962 INFO L93 Difference]: Finished difference Result 1248 states and 4380 transitions. [2020-01-16 18:41:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:00,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:00,965 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:41:00,966 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:41:00,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:41:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-01-16 18:41:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:41:00,986 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:41:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:00,986 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:41:00,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:41:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:00,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:00,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:00,987 INFO L426 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1971403365, now seen corresponding path program 1095 times [2020-01-16 18:41:00,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:00,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546016640] [2020-01-16 18:41:00,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:01,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546016640] [2020-01-16 18:41:01,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:01,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:01,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315157085] [2020-01-16 18:41:01,342 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:01,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:01,343 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:41:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:01,477 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-01-16 18:41:01,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:01,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:01,481 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:41:01,481 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:41:01,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:41:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:41:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:41:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:41:01,501 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:41:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:01,501 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:41:01,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:41:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:01,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:01,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:01,502 INFO L426 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1321803005, now seen corresponding path program 1096 times [2020-01-16 18:41:01,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:01,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111766159] [2020-01-16 18:41:01,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111766159] [2020-01-16 18:41:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:01,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:01,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717113001] [2020-01-16 18:41:01,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:01,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:01,861 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:41:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:01,993 INFO L93 Difference]: Finished difference Result 1244 states and 4368 transitions. [2020-01-16 18:41:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:01,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:01,996 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:41:01,996 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:41:01,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:41:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:41:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-01-16 18:41:02,016 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-01-16 18:41:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:02,016 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-01-16 18:41:02,016 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-01-16 18:41:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:02,017 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:02,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:02,017 INFO L426 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:02,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2026444743, now seen corresponding path program 1097 times [2020-01-16 18:41:02,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:02,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839658912] [2020-01-16 18:41:02,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:02,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-01-16 18:41:02,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839658912] [2020-01-16 18:41:02,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:02,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:02,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701273156] [2020-01-16 18:41:02,371 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:02,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:02,371 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:41:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:02,496 INFO L93 Difference]: Finished difference Result 1250 states and 4381 transitions. [2020-01-16 18:41:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:02,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:02,500 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:41:02,500 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:41:02,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:41:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2020-01-16 18:41:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:41:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-01-16 18:41:02,520 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-01-16 18:41:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:02,520 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-01-16 18:41:02,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-01-16 18:41:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:02,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:02,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:02,522 INFO L426 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash -657581595, now seen corresponding path program 1098 times [2020-01-16 18:41:02,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:02,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521671742] [2020-01-16 18:41:02,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:02,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521671742] [2020-01-16 18:41:02,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:02,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:02,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931817314] [2020-01-16 18:41:02,887 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:02,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:02,887 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:41:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:03,019 INFO L93 Difference]: Finished difference Result 1248 states and 4372 transitions. [2020-01-16 18:41:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:03,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:03,022 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:41:03,023 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:41:03,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:41:03,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-01-16 18:41:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3090 transitions. [2020-01-16 18:41:03,043 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:03,043 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3090 transitions. [2020-01-16 18:41:03,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3090 transitions. [2020-01-16 18:41:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:03,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:03,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:03,044 INFO L426 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -285193085, now seen corresponding path program 1099 times [2020-01-16 18:41:03,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:03,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687235529] [2020-01-16 18:41:03,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:03,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687235529] [2020-01-16 18:41:03,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:03,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:03,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856811997] [2020-01-16 18:41:03,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:03,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:03,402 INFO L87 Difference]: Start difference. First operand 775 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:03,528 INFO L93 Difference]: Finished difference Result 1257 states and 4405 transitions. [2020-01-16 18:41:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:03,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:03,531 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:41:03,532 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:41:03,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:41:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 786. [2020-01-16 18:41:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:41:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-01-16 18:41:03,553 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-01-16 18:41:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:03,553 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-01-16 18:41:03,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-01-16 18:41:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:03,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:03,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:03,554 INFO L426 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:03,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278465, now seen corresponding path program 1100 times [2020-01-16 18:41:03,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:03,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525775603] [2020-01-16 18:41:03,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:03,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-01-16 18:41:03,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525775603] [2020-01-16 18:41:03,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:03,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:03,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250343119] [2020-01-16 18:41:03,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:03,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:03,923 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:41:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:04,051 INFO L93 Difference]: Finished difference Result 1258 states and 4401 transitions. [2020-01-16 18:41:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:04,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:04,055 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:41:04,055 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:41:04,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:41:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 780. [2020-01-16 18:41:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3104 transitions. [2020-01-16 18:41:04,076 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3104 transitions. Word has length 25 [2020-01-16 18:41:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:04,076 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3104 transitions. [2020-01-16 18:41:04,076 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3104 transitions. [2020-01-16 18:41:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:04,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:04,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:04,077 INFO L426 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630939, now seen corresponding path program 1101 times [2020-01-16 18:41:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:04,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665351451] [2020-01-16 18:41:04,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:04,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665351451] [2020-01-16 18:41:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:04,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131496442] [2020-01-16 18:41:04,437 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:04,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:04,438 INFO L87 Difference]: Start difference. First operand 780 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:41:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:04,562 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-01-16 18:41:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:04,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:04,565 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:41:04,565 INFO L226 Difference]: Without dead ends: 1239 [2020-01-16 18:41:04,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-01-16 18:41:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 785. [2020-01-16 18:41:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:41:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3113 transitions. [2020-01-16 18:41:04,585 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3113 transitions. Word has length 25 [2020-01-16 18:41:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:04,585 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3113 transitions. [2020-01-16 18:41:04,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3113 transitions. [2020-01-16 18:41:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:04,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:04,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:04,587 INFO L426 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1347775361, now seen corresponding path program 1102 times [2020-01-16 18:41:04,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:04,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265747727] [2020-01-16 18:41:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:04,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265747727] [2020-01-16 18:41:04,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:04,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:04,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979505077] [2020-01-16 18:41:04,952 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:04,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:04,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:04,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:04,953 INFO L87 Difference]: Start difference. First operand 785 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:41:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:05,080 INFO L93 Difference]: Finished difference Result 1253 states and 4386 transitions. [2020-01-16 18:41:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:05,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:05,084 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:41:05,084 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:41:05,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:41:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 780. [2020-01-16 18:41:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-01-16 18:41:05,105 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-01-16 18:41:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:05,106 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-01-16 18:41:05,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-01-16 18:41:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:05,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:05,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:05,107 INFO L426 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1864624731, now seen corresponding path program 1103 times [2020-01-16 18:41:05,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:05,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454320790] [2020-01-16 18:41:05,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:05,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454320790] [2020-01-16 18:41:05,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:05,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:05,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717381902] [2020-01-16 18:41:05,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:05,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:05,471 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:41:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:05,589 INFO L93 Difference]: Finished difference Result 1256 states and 4392 transitions. [2020-01-16 18:41:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:05,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:05,592 INFO L225 Difference]: With dead ends: 1256 [2020-01-16 18:41:05,592 INFO L226 Difference]: Without dead ends: 1240 [2020-01-16 18:41:05,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-01-16 18:41:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 785. [2020-01-16 18:41:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:41:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3108 transitions. [2020-01-16 18:41:05,612 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3108 transitions. Word has length 25 [2020-01-16 18:41:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:05,612 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3108 transitions. [2020-01-16 18:41:05,612 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3108 transitions. [2020-01-16 18:41:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:05,613 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:05,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:05,613 INFO L426 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash -253683773, now seen corresponding path program 1104 times [2020-01-16 18:41:05,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:05,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163163292] [2020-01-16 18:41:05,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:05,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163163292] [2020-01-16 18:41:05,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:05,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:05,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114913905] [2020-01-16 18:41:05,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:05,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:05,967 INFO L87 Difference]: Start difference. First operand 785 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:41:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:06,095 INFO L93 Difference]: Finished difference Result 1254 states and 4383 transitions. [2020-01-16 18:41:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:06,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:06,099 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:41:06,099 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:41:06,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:41:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 771. [2020-01-16 18:41:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:41:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:41:06,120 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:41:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:06,121 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:41:06,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:41:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:06,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:06,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:06,122 INFO L426 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1331414369, now seen corresponding path program 1105 times [2020-01-16 18:41:06,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:06,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545018074] [2020-01-16 18:41:06,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:06,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-01-16 18:41:06,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545018074] [2020-01-16 18:41:06,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:06,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:06,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536865768] [2020-01-16 18:41:06,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:06,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:06,457 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:41:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:06,584 INFO L93 Difference]: Finished difference Result 1226 states and 4319 transitions. [2020-01-16 18:41:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:06,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:06,587 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:41:06,587 INFO L226 Difference]: Without dead ends: 1213 [2020-01-16 18:41:06,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-01-16 18:41:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 781. [2020-01-16 18:41:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-01-16 18:41:06,609 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-01-16 18:41:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:06,609 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-01-16 18:41:06,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-01-16 18:41:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:06,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:06,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:06,611 INFO L426 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1993301313, now seen corresponding path program 1106 times [2020-01-16 18:41:06,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:06,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022387960] [2020-01-16 18:41:06,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:06,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022387960] [2020-01-16 18:41:06,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:06,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:06,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181241675] [2020-01-16 18:41:06,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:06,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:06,942 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:41:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:07,074 INFO L93 Difference]: Finished difference Result 1228 states and 4319 transitions. [2020-01-16 18:41:07,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:07,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:07,077 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:41:07,077 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:41:07,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:41:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 777. [2020-01-16 18:41:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:41:07,097 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:41:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:07,097 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:41:07,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:41:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:07,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:07,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:07,099 INFO L426 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash 888515229, now seen corresponding path program 1107 times [2020-01-16 18:41:07,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:07,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800412198] [2020-01-16 18:41:07,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:07,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800412198] [2020-01-16 18:41:07,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:07,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:07,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643706295] [2020-01-16 18:41:07,434 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:07,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:07,434 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:41:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:07,583 INFO L93 Difference]: Finished difference Result 1227 states and 4317 transitions. [2020-01-16 18:41:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:07,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:07,587 INFO L225 Difference]: With dead ends: 1227 [2020-01-16 18:41:07,587 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:41:07,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:41:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-01-16 18:41:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:41:07,618 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:41:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:07,619 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:41:07,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:41:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:07,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:07,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:07,620 INFO L426 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1879773051, now seen corresponding path program 1108 times [2020-01-16 18:41:07,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:07,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629126726] [2020-01-16 18:41:07,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:07,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629126726] [2020-01-16 18:41:07,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:07,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:07,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050170644] [2020-01-16 18:41:07,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:07,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:07,951 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:41:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:08,095 INFO L93 Difference]: Finished difference Result 1230 states and 4319 transitions. [2020-01-16 18:41:08,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:08,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:08,098 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:41:08,098 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:41:08,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:41:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 777. [2020-01-16 18:41:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:41:08,118 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:41:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:08,118 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:41:08,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:41:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:08,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:08,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:08,119 INFO L426 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1329079903, now seen corresponding path program 1109 times [2020-01-16 18:41:08,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:08,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506886055] [2020-01-16 18:41:08,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:08,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506886055] [2020-01-16 18:41:08,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:08,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:08,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388661438] [2020-01-16 18:41:08,459 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:08,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:08,459 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:41:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:08,583 INFO L93 Difference]: Finished difference Result 1233 states and 4327 transitions. [2020-01-16 18:41:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:08,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:08,587 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:41:08,587 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:41:08,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:41:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-01-16 18:41:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:41:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3108 transitions. [2020-01-16 18:41:08,608 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3108 transitions. Word has length 25 [2020-01-16 18:41:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:08,608 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3108 transitions. [2020-01-16 18:41:08,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3108 transitions. [2020-01-16 18:41:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:08,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:08,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:08,609 INFO L426 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1892802013, now seen corresponding path program 1110 times [2020-01-16 18:41:08,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:08,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351715200] [2020-01-16 18:41:08,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:08,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-01-16 18:41:08,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351715200] [2020-01-16 18:41:08,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:08,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:08,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818296480] [2020-01-16 18:41:08,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:08,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:08,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:08,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:08,959 INFO L87 Difference]: Start difference. First operand 783 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:41:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:09,088 INFO L93 Difference]: Finished difference Result 1234 states and 4323 transitions. [2020-01-16 18:41:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:09,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:09,091 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:41:09,091 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:41:09,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:41:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 773. [2020-01-16 18:41:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:41:09,112 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:09,112 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:41:09,112 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:41:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:09,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:09,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:09,114 INFO L426 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash 63957191, now seen corresponding path program 1111 times [2020-01-16 18:41:09,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:09,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534293839] [2020-01-16 18:41:09,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:09,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534293839] [2020-01-16 18:41:09,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:09,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:09,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75761034] [2020-01-16 18:41:09,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:09,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:09,441 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:09,584 INFO L93 Difference]: Finished difference Result 1213 states and 4281 transitions. [2020-01-16 18:41:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:09,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:09,587 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:41:09,588 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:41:09,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:41:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-01-16 18:41:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:41:09,608 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:41:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:09,608 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:41:09,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:41:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:09,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:09,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:09,609 INFO L426 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1034208805, now seen corresponding path program 1112 times [2020-01-16 18:41:09,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:09,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312900100] [2020-01-16 18:41:09,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:09,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312900100] [2020-01-16 18:41:09,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:09,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:09,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905326891] [2020-01-16 18:41:09,932 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:09,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:09,932 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:41:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:10,066 INFO L93 Difference]: Finished difference Result 1215 states and 4281 transitions. [2020-01-16 18:41:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:10,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:10,070 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:41:10,070 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:10,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:41:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:41:10,089 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:41:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:10,090 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:41:10,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:41:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:10,091 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:10,091 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:10,091 INFO L426 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1104192989, now seen corresponding path program 1113 times [2020-01-16 18:41:10,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:10,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078708443] [2020-01-16 18:41:10,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:10,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078708443] [2020-01-16 18:41:10,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:10,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:10,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782281480] [2020-01-16 18:41:10,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:10,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:10,426 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:41:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:10,559 INFO L93 Difference]: Finished difference Result 1207 states and 4265 transitions. [2020-01-16 18:41:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:10,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:10,563 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:41:10,563 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:10,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:41:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:41:10,583 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:41:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:10,583 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:41:10,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:41:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:10,584 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:10,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:10,585 INFO L426 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2126960123, now seen corresponding path program 1114 times [2020-01-16 18:41:10,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:10,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416565101] [2020-01-16 18:41:10,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:10,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-01-16 18:41:10,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416565101] [2020-01-16 18:41:10,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:10,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:10,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088772052] [2020-01-16 18:41:10,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:10,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:10,911 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:41:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:11,051 INFO L93 Difference]: Finished difference Result 1205 states and 4259 transitions. [2020-01-16 18:41:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:11,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:11,054 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:41:11,054 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:41:11,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:41:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:41:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:41:11,074 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:41:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:11,075 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:41:11,075 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:41:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:11,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:11,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:11,076 INFO L426 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1619748409, now seen corresponding path program 1115 times [2020-01-16 18:41:11,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:11,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380769070] [2020-01-16 18:41:11,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:11,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380769070] [2020-01-16 18:41:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827492111] [2020-01-16 18:41:11,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:11,401 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:41:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:11,541 INFO L93 Difference]: Finished difference Result 1211 states and 4271 transitions. [2020-01-16 18:41:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:11,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:11,545 INFO L225 Difference]: With dead ends: 1211 [2020-01-16 18:41:11,545 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:11,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:41:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:41:11,564 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:41:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:11,565 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:41:11,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:41:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:11,566 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:11,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:11,566 INFO L426 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2139989085, now seen corresponding path program 1116 times [2020-01-16 18:41:11,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:11,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051226271] [2020-01-16 18:41:11,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:11,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051226271] [2020-01-16 18:41:11,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:11,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33620366] [2020-01-16 18:41:11,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:11,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:11,881 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:41:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:12,027 INFO L93 Difference]: Finished difference Result 1207 states and 4261 transitions. [2020-01-16 18:41:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:12,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:12,030 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:41:12,031 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:41:12,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:41:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-01-16 18:41:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:41:12,051 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:41:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:12,051 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:41:12,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:41:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:12,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:12,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:12,052 INFO L426 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1223913401, now seen corresponding path program 1117 times [2020-01-16 18:41:12,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:12,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936926084] [2020-01-16 18:41:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:12,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936926084] [2020-01-16 18:41:12,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:12,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:12,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021090070] [2020-01-16 18:41:12,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:12,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:12,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:12,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:12,379 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:41:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:12,553 INFO L93 Difference]: Finished difference Result 1215 states and 4283 transitions. [2020-01-16 18:41:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:12,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:12,557 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:41:12,557 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:12,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 779. [2020-01-16 18:41:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:41:12,577 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:41:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:12,577 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:41:12,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:41:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:12,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:12,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:12,578 INFO L426 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash -232655579, now seen corresponding path program 1118 times [2020-01-16 18:41:12,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:12,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370482022] [2020-01-16 18:41:12,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:12,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370482022] [2020-01-16 18:41:12,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:12,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:12,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843998866] [2020-01-16 18:41:12,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:12,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:12,917 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:41:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:13,096 INFO L93 Difference]: Finished difference Result 1218 states and 4285 transitions. [2020-01-16 18:41:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:13,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:13,099 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:41:13,099 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:41:13,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:41:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2020-01-16 18:41:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:41:13,119 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:41:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:13,119 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:41:13,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:41:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:13,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:13,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:13,120 INFO L426 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash 259221537, now seen corresponding path program 1119 times [2020-01-16 18:41:13,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:13,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182377274] [2020-01-16 18:41:13,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:13,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182377274] [2020-01-16 18:41:13,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:13,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:13,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58278311] [2020-01-16 18:41:13,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:13,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:13,445 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:41:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:13,586 INFO L93 Difference]: Finished difference Result 1208 states and 4265 transitions. [2020-01-16 18:41:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:13,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:13,590 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:41:13,590 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:41:13,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:41:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-01-16 18:41:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:41:13,609 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:41:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:13,610 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:41:13,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:41:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:13,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:13,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:13,611 INFO L426 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988671, now seen corresponding path program 1120 times [2020-01-16 18:41:13,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:13,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321673110] [2020-01-16 18:41:13,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:13,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321673110] [2020-01-16 18:41:13,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:13,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:13,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507525861] [2020-01-16 18:41:13,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:13,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:13,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:13,945 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:41:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:14,089 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-01-16 18:41:14,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:14,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:14,093 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:41:14,093 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:14,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:41:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:41:14,113 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:41:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:14,113 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:41:14,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:41:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:14,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:14,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:14,114 INFO L426 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:14,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1408354503, now seen corresponding path program 1121 times [2020-01-16 18:41:14,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:14,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464893995] [2020-01-16 18:41:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:14,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464893995] [2020-01-16 18:41:14,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:14,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:14,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362065769] [2020-01-16 18:41:14,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:14,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:14,451 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:41:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:14,591 INFO L93 Difference]: Finished difference Result 1214 states and 4275 transitions. [2020-01-16 18:41:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:14,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:14,594 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:41:14,595 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:41:14,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:41:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:41:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:41:14,615 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:14,615 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:41:14,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:41:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:14,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:14,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:14,616 INFO L426 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1946210081, now seen corresponding path program 1122 times [2020-01-16 18:41:14,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518856026] [2020-01-16 18:41:14,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:14,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518856026] [2020-01-16 18:41:14,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:14,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:14,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912765340] [2020-01-16 18:41:14,953 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:14,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:14,954 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:15,132 INFO L93 Difference]: Finished difference Result 1209 states and 4263 transitions. [2020-01-16 18:41:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:15,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:15,135 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:41:15,135 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:15,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 773. [2020-01-16 18:41:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:41:15,156 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:41:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:15,156 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:41:15,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:41:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:15,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:15,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:15,157 INFO L426 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1997374913, now seen corresponding path program 1123 times [2020-01-16 18:41:15,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:15,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694326617] [2020-01-16 18:41:15,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:15,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694326617] [2020-01-16 18:41:15,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:15,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:15,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378852277] [2020-01-16 18:41:15,489 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:15,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:15,490 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:41:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:15,643 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-01-16 18:41:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:15,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:15,646 INFO L225 Difference]: With dead ends: 1225 [2020-01-16 18:41:15,646 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:41:15,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:41:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-01-16 18:41:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:41:15,666 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:41:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:15,666 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:41:15,666 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:41:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:15,667 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:15,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:15,668 INFO L426 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1224507003, now seen corresponding path program 1124 times [2020-01-16 18:41:15,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:15,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280506868] [2020-01-16 18:41:15,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:16,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280506868] [2020-01-16 18:41:16,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:16,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:16,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922289759] [2020-01-16 18:41:16,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:16,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:16,015 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:41:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:16,152 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:41:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:16,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:16,156 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:41:16,156 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:41:16,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:41:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 775. [2020-01-16 18:41:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:41:16,176 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:41:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:16,176 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:41:16,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:41:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:16,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:16,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] [2020-01-16 18:41:16,178 INFO L426 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246117, now seen corresponding path program 1125 times [2020-01-16 18:41:16,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:16,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678900169] [2020-01-16 18:41:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:16,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678900169] [2020-01-16 18:41:16,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:16,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:16,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336816316] [2020-01-16 18:41:16,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:16,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:16,495 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:41:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:16,668 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:41:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:16,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:16,672 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:41:16,672 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:41:16,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:41:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-01-16 18:41:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:41:16,692 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:16,693 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:41:16,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:41:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:16,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:16,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:16,694 INFO L426 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1256016315, now seen corresponding path program 1126 times [2020-01-16 18:41:16,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:16,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968048814] [2020-01-16 18:41:16,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:17,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-01-16 18:41:17,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968048814] [2020-01-16 18:41:17,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:17,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:17,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715957420] [2020-01-16 18:41:17,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:17,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:17,015 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:17,184 INFO L93 Difference]: Finished difference Result 1212 states and 4271 transitions. [2020-01-16 18:41:17,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:17,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:17,188 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:41:17,188 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:41:17,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:41:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-01-16 18:41:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:17,208 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:17,208 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:17,208 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:17,209 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:17,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:17,209 INFO L426 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1812252325, now seen corresponding path program 1127 times [2020-01-16 18:41:17,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313628137] [2020-01-16 18:41:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:17,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313628137] [2020-01-16 18:41:17,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:17,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:17,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680528392] [2020-01-16 18:41:17,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:17,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:17,557 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:17,695 INFO L93 Difference]: Finished difference Result 1218 states and 4283 transitions. [2020-01-16 18:41:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:17,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:17,698 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:41:17,698 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:17,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:41:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:17,719 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:17,719 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:17,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:17,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:17,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] [2020-01-16 18:41:17,721 INFO L426 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:17,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1944859393, now seen corresponding path program 1128 times [2020-01-16 18:41:17,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:17,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184854678] [2020-01-16 18:41:17,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184854678] [2020-01-16 18:41:18,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:18,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:18,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332327866] [2020-01-16 18:41:18,052 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:18,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:18,053 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:18,197 INFO L93 Difference]: Finished difference Result 1213 states and 4271 transitions. [2020-01-16 18:41:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:18,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:18,200 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:41:18,200 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:18,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 771. [2020-01-16 18:41:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:41:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:41:18,221 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:41:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:18,221 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:41:18,221 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:41:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:18,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:18,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:18,223 INFO L426 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 696773025, now seen corresponding path program 1129 times [2020-01-16 18:41:18,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:18,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295891364] [2020-01-16 18:41:18,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:18,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295891364] [2020-01-16 18:41:18,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:18,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:18,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33535548] [2020-01-16 18:41:18,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:18,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:18,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:18,574 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:41:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:18,716 INFO L93 Difference]: Finished difference Result 1220 states and 4303 transitions. [2020-01-16 18:41:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:18,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:18,719 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:41:18,719 INFO L226 Difference]: Without dead ends: 1207 [2020-01-16 18:41:18,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-01-16 18:41:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 781. [2020-01-16 18:41:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:41:18,755 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:41:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:18,756 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:41:18,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:41:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:18,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:18,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:18,757 INFO L426 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1667024639, now seen corresponding path program 1130 times [2020-01-16 18:41:18,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:18,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607944996] [2020-01-16 18:41:18,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:19,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607944996] [2020-01-16 18:41:19,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:19,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:19,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614066614] [2020-01-16 18:41:19,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:19,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:19,107 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:41:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:19,264 INFO L93 Difference]: Finished difference Result 1222 states and 4303 transitions. [2020-01-16 18:41:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:19,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:19,267 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:41:19,267 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:41:19,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:41:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 777. [2020-01-16 18:41:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-01-16 18:41:19,288 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-01-16 18:41:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:19,288 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-01-16 18:41:19,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-01-16 18:41:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:19,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:19,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] [2020-01-16 18:41:19,289 INFO L426 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059333, now seen corresponding path program 1131 times [2020-01-16 18:41:19,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:19,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151953657] [2020-01-16 18:41:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:19,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-01-16 18:41:19,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151953657] [2020-01-16 18:41:19,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:19,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:19,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496606715] [2020-01-16 18:41:19,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:19,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:19,645 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:41:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:19,801 INFO L93 Difference]: Finished difference Result 1219 states and 4297 transitions. [2020-01-16 18:41:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:19,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:19,804 INFO L225 Difference]: With dead ends: 1219 [2020-01-16 18:41:19,804 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:41:19,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:41:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-01-16 18:41:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-01-16 18:41:19,825 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-01-16 18:41:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:19,825 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-01-16 18:41:19,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-01-16 18:41:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:19,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:19,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:19,826 INFO L426 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1113298407, now seen corresponding path program 1132 times [2020-01-16 18:41:19,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:19,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524420373] [2020-01-16 18:41:19,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:20,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524420373] [2020-01-16 18:41:20,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:20,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:20,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428470230] [2020-01-16 18:41:20,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:20,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:20,183 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:41:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:20,339 INFO L93 Difference]: Finished difference Result 1220 states and 4295 transitions. [2020-01-16 18:41:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:20,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:20,343 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:41:20,343 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:20,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:41:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:41:20,362 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:41:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:20,362 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:41:20,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:41:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:20,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:20,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:20,364 INFO L426 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1638125023, now seen corresponding path program 1133 times [2020-01-16 18:41:20,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:20,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303533983] [2020-01-16 18:41:20,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:20,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303533983] [2020-01-16 18:41:20,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:20,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:20,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921150326] [2020-01-16 18:41:20,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:20,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:20,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:20,716 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:41:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:20,850 INFO L93 Difference]: Finished difference Result 1224 states and 4304 transitions. [2020-01-16 18:41:20,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:20,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:20,853 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:41:20,854 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:41:20,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:41:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-01-16 18:41:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:41:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3104 transitions. [2020-01-16 18:41:20,875 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3104 transitions. Word has length 25 [2020-01-16 18:41:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:20,875 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3104 transitions. [2020-01-16 18:41:20,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3104 transitions. [2020-01-16 18:41:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:20,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:20,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:20,876 INFO L426 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1100269445, now seen corresponding path program 1134 times [2020-01-16 18:41:20,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:20,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217748675] [2020-01-16 18:41:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:21,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-01-16 18:41:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217748675] [2020-01-16 18:41:21,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:21,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:21,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970784955] [2020-01-16 18:41:21,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:21,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:21,232 INFO L87 Difference]: Start difference. First operand 782 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:41:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:21,370 INFO L93 Difference]: Finished difference Result 1223 states and 4297 transitions. [2020-01-16 18:41:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:21,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:21,373 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:41:21,373 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:41:21,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:41:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 773. [2020-01-16 18:41:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:41:21,394 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:41:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:21,394 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:41:21,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:41:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:21,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:21,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:21,395 INFO L426 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -148198427, now seen corresponding path program 1135 times [2020-01-16 18:41:21,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:21,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982346502] [2020-01-16 18:41:21,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:21,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-01-16 18:41:21,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982346502] [2020-01-16 18:41:21,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:21,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:21,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852319929] [2020-01-16 18:41:21,734 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:21,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:21,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:21,735 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:41:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:21,896 INFO L93 Difference]: Finished difference Result 1210 states and 4272 transitions. [2020-01-16 18:41:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:21,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:21,899 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:41:21,899 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:41:21,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:41:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 779. [2020-01-16 18:41:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:41:21,918 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:41:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:21,918 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:41:21,918 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:41:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:21,919 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:21,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:21,919 INFO L426 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash 822053187, now seen corresponding path program 1136 times [2020-01-16 18:41:21,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:21,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258289399] [2020-01-16 18:41:21,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:22,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258289399] [2020-01-16 18:41:22,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:22,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:22,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416219374] [2020-01-16 18:41:22,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:22,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:22,265 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:41:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:22,390 INFO L93 Difference]: Finished difference Result 1212 states and 4272 transitions. [2020-01-16 18:41:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:22,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:22,394 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:41:22,394 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:22,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:41:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:41:22,414 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:41:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:22,414 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:41:22,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:41:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:22,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:22,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:22,415 INFO L426 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 892037371, now seen corresponding path program 1137 times [2020-01-16 18:41:22,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:22,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243465613] [2020-01-16 18:41:22,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243465613] [2020-01-16 18:41:22,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:22,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:22,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987744651] [2020-01-16 18:41:22,754 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:22,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:22,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:22,754 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:41:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:22,889 INFO L93 Difference]: Finished difference Result 1204 states and 4256 transitions. [2020-01-16 18:41:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:22,893 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:41:22,893 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:22,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:41:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:41:22,913 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:41:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:22,913 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:41:22,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:41:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:22,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:22,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:22,915 INFO L426 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804505, now seen corresponding path program 1138 times [2020-01-16 18:41:22,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:22,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046697178] [2020-01-16 18:41:22,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:23,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046697178] [2020-01-16 18:41:23,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:23,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:23,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903665123] [2020-01-16 18:41:23,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:23,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:23,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:23,259 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:41:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:23,427 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-01-16 18:41:23,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:23,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:23,430 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:41:23,430 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:41:23,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:41:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-01-16 18:41:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:41:23,451 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:41:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:23,451 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:41:23,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:41:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:23,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:23,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:23,452 INFO L426 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1831904027, now seen corresponding path program 1139 times [2020-01-16 18:41:23,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:23,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626601635] [2020-01-16 18:41:23,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:23,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-01-16 18:41:23,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626601635] [2020-01-16 18:41:23,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:23,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:23,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561592417] [2020-01-16 18:41:23,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:23,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:23,786 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:41:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:23,922 INFO L93 Difference]: Finished difference Result 1208 states and 4262 transitions. [2020-01-16 18:41:23,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:23,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:23,925 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:41:23,925 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:23,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:41:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:41:23,946 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:23,946 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:41:23,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:41:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:23,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:23,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:23,947 INFO L426 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1927833467, now seen corresponding path program 1140 times [2020-01-16 18:41:23,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:23,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928815835] [2020-01-16 18:41:23,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:24,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928815835] [2020-01-16 18:41:24,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:24,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:24,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142961844] [2020-01-16 18:41:24,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:24,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:24,289 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:24,424 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:41:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:24,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:24,427 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:41:24,427 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:41:24,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:41:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-01-16 18:41:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:41:24,446 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:41:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:24,447 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:41:24,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:41:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:24,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:24,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:24,448 INFO L426 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 67479333, now seen corresponding path program 1141 times [2020-01-16 18:41:24,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:24,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108850579] [2020-01-16 18:41:24,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:24,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108850579] [2020-01-16 18:41:24,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:24,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:24,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149742172] [2020-01-16 18:41:24,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:24,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:24,796 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:41:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:24,931 INFO L93 Difference]: Finished difference Result 1208 states and 4266 transitions. [2020-01-16 18:41:24,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:24,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:24,934 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:41:24,934 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:41:24,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:41:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-01-16 18:41:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:41:24,972 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:41:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:24,972 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:41:24,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:41:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:24,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:24,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:24,973 INFO L426 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1069240259, now seen corresponding path program 1142 times [2020-01-16 18:41:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041833153] [2020-01-16 18:41:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:25,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041833153] [2020-01-16 18:41:25,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:25,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:25,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665141749] [2020-01-16 18:41:25,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:25,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:25,326 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:41:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:25,457 INFO L93 Difference]: Finished difference Result 1209 states and 4264 transitions. [2020-01-16 18:41:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:25,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:25,460 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:41:25,461 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:25,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-01-16 18:41:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:41:25,481 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:41:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:25,481 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:41:25,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:41:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:25,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:25,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:25,483 INFO L426 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -375419807, now seen corresponding path program 1143 times [2020-01-16 18:41:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:25,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587124406] [2020-01-16 18:41:25,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:25,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-01-16 18:41:25,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587124406] [2020-01-16 18:41:25,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:25,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:25,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708853475] [2020-01-16 18:41:25,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:25,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:25,831 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:41:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:25,957 INFO L93 Difference]: Finished difference Result 1203 states and 4252 transitions. [2020-01-16 18:41:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:25,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:25,961 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:41:25,961 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:41:25,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:41:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:41:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:41:25,980 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:25,980 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:41:25,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:41:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:25,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:25,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:25,982 INFO L426 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:25,982 INFO L82 PathProgramCache]: Analyzing trace with hash 647347327, now seen corresponding path program 1144 times [2020-01-16 18:41:25,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:25,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207903979] [2020-01-16 18:41:25,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:26,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207903979] [2020-01-16 18:41:26,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:26,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:26,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721370806] [2020-01-16 18:41:26,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:26,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:26,344 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:26,473 INFO L93 Difference]: Finished difference Result 1201 states and 4246 transitions. [2020-01-16 18:41:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:26,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:26,477 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:41:26,477 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:41:26,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:41:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-01-16 18:41:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:26,497 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:26,497 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:26,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:26,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:26,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:26,498 INFO L426 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1584716955, now seen corresponding path program 1145 times [2020-01-16 18:41:26,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:26,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615348151] [2020-01-16 18:41:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:26,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615348151] [2020-01-16 18:41:26,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:26,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:26,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900107051] [2020-01-16 18:41:26,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:26,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:26,861 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:27,000 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-01-16 18:41:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:27,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:27,004 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:41:27,004 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:27,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:41:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:27,024 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:27,024 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:27,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:27,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:27,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:27,025 INFO L426 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1637164961, now seen corresponding path program 1146 times [2020-01-16 18:41:27,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:27,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872322490] [2020-01-16 18:41:27,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:27,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872322490] [2020-01-16 18:41:27,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:27,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164946843] [2020-01-16 18:41:27,367 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:27,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:27,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:27,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:27,368 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:27,495 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-01-16 18:41:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:27,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:27,498 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:41:27,498 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:41:27,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:41:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 773. [2020-01-16 18:41:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:41:27,518 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:41:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:27,518 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:41:27,518 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:41:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:27,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:27,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:27,519 INFO L426 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1988547263, now seen corresponding path program 1147 times [2020-01-16 18:41:27,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:27,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539850865] [2020-01-16 18:41:27,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:27,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539850865] [2020-01-16 18:41:27,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:27,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657811867] [2020-01-16 18:41:27,875 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:27,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:27,875 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:41:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:28,019 INFO L93 Difference]: Finished difference Result 1216 states and 4282 transitions. [2020-01-16 18:41:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:28,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:28,022 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:41:28,022 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:41:28,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:41:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 780. [2020-01-16 18:41:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-01-16 18:41:28,043 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-01-16 18:41:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:28,044 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-01-16 18:41:28,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-01-16 18:41:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:28,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:28,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:28,045 INFO L426 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1768564455, now seen corresponding path program 1148 times [2020-01-16 18:41:28,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:28,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049297958] [2020-01-16 18:41:28,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:28,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049297958] [2020-01-16 18:41:28,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:28,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:28,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467595201] [2020-01-16 18:41:28,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:28,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:28,405 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:41:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:28,551 INFO L93 Difference]: Finished difference Result 1215 states and 4275 transitions. [2020-01-16 18:41:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:28,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:28,554 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:41:28,554 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:28,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:41:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:28,575 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:28,575 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:28,575 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:28,576 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:28,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:28,576 INFO L426 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1212328445, now seen corresponding path program 1149 times [2020-01-16 18:41:28,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:28,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427187684] [2020-01-16 18:41:28,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:28,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427187684] [2020-01-16 18:41:28,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:28,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:28,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675307572] [2020-01-16 18:41:28,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:28,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:28,917 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:29,048 INFO L93 Difference]: Finished difference Result 1210 states and 4265 transitions. [2020-01-16 18:41:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:29,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:29,052 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:41:29,052 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:41:29,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:41:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-01-16 18:41:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:29,073 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:29,073 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:29,073 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:29,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:29,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:29,074 INFO L426 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1747558247, now seen corresponding path program 1150 times [2020-01-16 18:41:29,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:29,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024370333] [2020-01-16 18:41:29,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:29,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024370333] [2020-01-16 18:41:29,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:29,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:29,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449981229] [2020-01-16 18:41:29,402 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:29,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:29,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:29,403 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:29,544 INFO L93 Difference]: Finished difference Result 1206 states and 4255 transitions. [2020-01-16 18:41:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:29,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:29,547 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:41:29,547 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:29,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:41:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:41:29,567 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:41:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:29,568 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:41:29,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:41:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:29,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:29,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:29,569 INFO L426 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:29,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1180819133, now seen corresponding path program 1151 times [2020-01-16 18:41:29,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:29,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704379863] [2020-01-16 18:41:29,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:29,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704379863] [2020-01-16 18:41:29,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:29,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:29,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992378119] [2020-01-16 18:41:29,928 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:29,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:29,928 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:41:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:30,065 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-01-16 18:41:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:30,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:30,068 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:41:30,068 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:30,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:41:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:41:30,089 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:30,089 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:41:30,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:41:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:30,090 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:30,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:30,090 INFO L426 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2041062783, now seen corresponding path program 1152 times [2020-01-16 18:41:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:30,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684758870] [2020-01-16 18:41:30,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:30,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684758870] [2020-01-16 18:41:30,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:30,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:30,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929477989] [2020-01-16 18:41:30,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:30,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:30,426 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:30,552 INFO L93 Difference]: Finished difference Result 1205 states and 4251 transitions. [2020-01-16 18:41:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:30,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:30,555 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:41:30,556 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:41:30,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:41:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 771. [2020-01-16 18:41:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:41:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:41:30,577 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:41:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:30,577 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:41:30,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:41:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:30,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:30,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:30,578 INFO L426 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1015408803, now seen corresponding path program 1153 times [2020-01-16 18:41:30,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:30,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440766330] [2020-01-16 18:41:30,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:30,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440766330] [2020-01-16 18:41:30,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:30,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:30,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647239121] [2020-01-16 18:41:30,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:30,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:30,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:30,907 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:41:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:31,044 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-01-16 18:41:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:31,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:31,047 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:41:31,047 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:41:31,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:41:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-01-16 18:41:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:41:31,066 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:41:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:31,066 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:41:31,066 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:41:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:31,067 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:31,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:31,068 INFO L426 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash -24150981, now seen corresponding path program 1154 times [2020-01-16 18:41:31,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:31,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864540361] [2020-01-16 18:41:31,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:31,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864540361] [2020-01-16 18:41:31,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:31,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:31,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984203563] [2020-01-16 18:41:31,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:31,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:31,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:31,397 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:41:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:31,542 INFO L93 Difference]: Finished difference Result 1226 states and 4309 transitions. [2020-01-16 18:41:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:31,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:31,545 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:41:31,546 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:41:31,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:41:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-01-16 18:41:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:41:31,566 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:41:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:31,566 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:41:31,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:41:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:31,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:31,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:31,567 INFO L426 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 910625275, now seen corresponding path program 1155 times [2020-01-16 18:41:31,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:31,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689483746] [2020-01-16 18:41:31,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:31,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689483746] [2020-01-16 18:41:31,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:31,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:31,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194950064] [2020-01-16 18:41:31,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:31,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:31,906 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:41:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:32,033 INFO L93 Difference]: Finished difference Result 1221 states and 4299 transitions. [2020-01-16 18:41:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:32,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:32,036 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:41:32,036 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:41:32,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:41:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 781. [2020-01-16 18:41:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:41:32,057 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:41:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:32,058 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:41:32,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:41:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:32,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:32,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:32,059 INFO L426 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1912386201, now seen corresponding path program 1156 times [2020-01-16 18:41:32,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:32,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937066056] [2020-01-16 18:41:32,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:32,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-01-16 18:41:32,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937066056] [2020-01-16 18:41:32,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:32,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:32,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032761001] [2020-01-16 18:41:32,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:32,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:32,392 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:41:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:32,527 INFO L93 Difference]: Finished difference Result 1222 states and 4297 transitions. [2020-01-16 18:41:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:32,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:32,530 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:41:32,530 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:41:32,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:41:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-01-16 18:41:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3093 transitions. [2020-01-16 18:41:32,550 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3093 transitions. Word has length 25 [2020-01-16 18:41:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:32,550 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3093 transitions. [2020-01-16 18:41:32,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3093 transitions. [2020-01-16 18:41:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:32,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:32,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:32,552 INFO L426 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 965666653, now seen corresponding path program 1157 times [2020-01-16 18:41:32,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:32,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061467716] [2020-01-16 18:41:32,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:32,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061467716] [2020-01-16 18:41:32,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:32,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:32,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368985633] [2020-01-16 18:41:32,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:32,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:32,881 INFO L87 Difference]: Start difference. First operand 777 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:41:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:33,012 INFO L93 Difference]: Finished difference Result 1228 states and 4310 transitions. [2020-01-16 18:41:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:33,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:33,016 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:41:33,016 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:41:33,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:41:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-01-16 18:41:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:41:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3102 transitions. [2020-01-16 18:41:33,037 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3102 transitions. Word has length 25 [2020-01-16 18:41:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:33,037 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3102 transitions. [2020-01-16 18:41:33,037 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3102 transitions. [2020-01-16 18:41:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:33,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:33,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:33,038 INFO L426 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1718359685, now seen corresponding path program 1158 times [2020-01-16 18:41:33,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:33,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566271762] [2020-01-16 18:41:33,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:33,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566271762] [2020-01-16 18:41:33,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:33,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:33,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564626478] [2020-01-16 18:41:33,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:33,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:33,390 INFO L87 Difference]: Start difference. First operand 782 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:41:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:33,513 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:41:33,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:33,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:33,517 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:41:33,517 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:41:33,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:41:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 773. [2020-01-16 18:41:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:41:33,537 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:41:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:33,537 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:41:33,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:41:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:33,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:33,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:33,538 INFO L426 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1860380255, now seen corresponding path program 1159 times [2020-01-16 18:41:33,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:33,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008521654] [2020-01-16 18:41:33,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:33,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-01-16 18:41:33,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008521654] [2020-01-16 18:41:33,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:33,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:33,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822920229] [2020-01-16 18:41:33,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:33,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:33,867 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:41:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:33,988 INFO L93 Difference]: Finished difference Result 1213 states and 4276 transitions. [2020-01-16 18:41:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:33,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:33,991 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:41:33,991 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:41:33,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:41:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-01-16 18:41:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:41:34,012 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:41:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:34,012 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:41:34,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:41:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:34,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:34,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:34,014 INFO L426 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -869122433, now seen corresponding path program 1160 times [2020-01-16 18:41:34,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:34,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216977260] [2020-01-16 18:41:34,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:34,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216977260] [2020-01-16 18:41:34,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:34,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:34,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758813007] [2020-01-16 18:41:34,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:34,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:34,340 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:41:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:34,468 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-01-16 18:41:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:34,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:34,472 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:41:34,472 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:34,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:41:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:41:34,492 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:41:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:34,492 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:41:34,492 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:41:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:34,493 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:34,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:34,493 INFO L426 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -377245317, now seen corresponding path program 1161 times [2020-01-16 18:41:34,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:34,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347503877] [2020-01-16 18:41:34,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:34,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-01-16 18:41:34,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347503877] [2020-01-16 18:41:34,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:34,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:34,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726940613] [2020-01-16 18:41:34,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:34,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:34,824 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:41:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:34,989 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-01-16 18:41:34,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:34,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:34,992 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:41:34,992 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:34,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:41:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:41:35,013 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:35,013 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:41:35,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:41:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:35,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:35,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:35,014 INFO L426 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash 645521817, now seen corresponding path program 1162 times [2020-01-16 18:41:35,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:35,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670856784] [2020-01-16 18:41:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:35,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670856784] [2020-01-16 18:41:35,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:35,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:35,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514452358] [2020-01-16 18:41:35,344 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:35,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:35,344 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:35,486 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:41:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:35,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:35,489 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:41:35,489 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:35,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-01-16 18:41:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:35,510 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:35,510 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:35,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:35,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:35,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:35,511 INFO L426 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 771887649, now seen corresponding path program 1163 times [2020-01-16 18:41:35,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:35,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031044484] [2020-01-16 18:41:35,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:35,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031044484] [2020-01-16 18:41:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:35,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:35,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605712982] [2020-01-16 18:41:35,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:35,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:35,827 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:35,990 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:41:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:35,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:35,993 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:41:35,993 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:35,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:41:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:36,014 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:36,014 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:36,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:36,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:36,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:36,015 INFO L426 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743227, now seen corresponding path program 1164 times [2020-01-16 18:41:36,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:36,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118119087] [2020-01-16 18:41:36,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:36,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118119087] [2020-01-16 18:41:36,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:36,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:36,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365267069] [2020-01-16 18:41:36,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:36,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:36,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:36,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:36,336 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:36,480 INFO L93 Difference]: Finished difference Result 1207 states and 4256 transitions. [2020-01-16 18:41:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:36,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:36,483 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:41:36,484 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:41:36,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:41:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-01-16 18:41:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:41:36,503 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:41:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:36,503 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:41:36,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:41:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:36,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:36,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:36,505 INFO L426 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash -356831903, now seen corresponding path program 1165 times [2020-01-16 18:41:36,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:36,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542151927] [2020-01-16 18:41:36,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:36,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542151927] [2020-01-16 18:41:36,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:36,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:36,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518938165] [2020-01-16 18:41:36,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:36,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:36,866 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:41:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:37,004 INFO L93 Difference]: Finished difference Result 1209 states and 4266 transitions. [2020-01-16 18:41:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:37,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:37,007 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:41:37,007 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:37,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-01-16 18:41:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:41:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:41:37,027 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:41:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:37,027 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:41:37,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:41:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:37,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:37,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:37,028 INFO L426 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 644929023, now seen corresponding path program 1166 times [2020-01-16 18:41:37,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:37,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223172408] [2020-01-16 18:41:37,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:37,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-01-16 18:41:37,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223172408] [2020-01-16 18:41:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:37,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:37,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728496609] [2020-01-16 18:41:37,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:37,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:37,363 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:41:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:37,504 INFO L93 Difference]: Finished difference Result 1210 states and 4264 transitions. [2020-01-16 18:41:37,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:37,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:37,507 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:41:37,507 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:41:37,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:41:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:41:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:37,527 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:37,527 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:37,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:37,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:37,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:37,528 INFO L426 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -799731043, now seen corresponding path program 1167 times [2020-01-16 18:41:37,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:37,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694412148] [2020-01-16 18:41:37,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:37,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694412148] [2020-01-16 18:41:37,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:37,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:37,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069967000] [2020-01-16 18:41:37,862 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:37,862 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:37,990 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:41:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:37,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:37,994 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:41:37,994 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:37,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:41:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:38,014 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:38,014 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:38,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:38,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:38,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:38,015 INFO L426 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 223036091, now seen corresponding path program 1168 times [2020-01-16 18:41:38,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:38,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955463603] [2020-01-16 18:41:38,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:38,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955463603] [2020-01-16 18:41:38,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:38,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:38,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140371562] [2020-01-16 18:41:38,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:38,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:38,343 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:38,501 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-01-16 18:41:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:38,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:38,504 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:41:38,504 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:41:38,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:41:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-01-16 18:41:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:41:38,636 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:41:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:38,648 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:41:38,648 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:41:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:38,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:38,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:38,649 INFO L426 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2009028191, now seen corresponding path program 1169 times [2020-01-16 18:41:38,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:38,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601950846] [2020-01-16 18:41:38,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:38,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601950846] [2020-01-16 18:41:38,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:38,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:38,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401276832] [2020-01-16 18:41:38,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:38,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:38,981 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:41:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:39,114 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-01-16 18:41:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:39,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:39,118 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:41:39,118 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:41:39,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:41:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-01-16 18:41:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:41:39,140 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:39,140 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:41:39,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:41:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:39,141 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:39,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:39,141 INFO L426 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:39,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1212853725, now seen corresponding path program 1170 times [2020-01-16 18:41:39,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:39,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123790293] [2020-01-16 18:41:39,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:39,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123790293] [2020-01-16 18:41:39,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:39,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:39,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308821858] [2020-01-16 18:41:39,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:39,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:39,470 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:39,631 INFO L93 Difference]: Finished difference Result 1203 states and 4246 transitions. [2020-01-16 18:41:39,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:39,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:39,634 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:41:39,634 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:41:39,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:41:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 773. [2020-01-16 18:41:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:41:39,654 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:41:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:39,654 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:41:39,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:41:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:39,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:39,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:39,655 INFO L426 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 297371643, now seen corresponding path program 1171 times [2020-01-16 18:41:39,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:39,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953217348] [2020-01-16 18:41:39,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:39,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953217348] [2020-01-16 18:41:39,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:39,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079561322] [2020-01-16 18:41:39,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:39,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:39,977 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:41:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:40,125 INFO L93 Difference]: Finished difference Result 1220 states and 4288 transitions. [2020-01-16 18:41:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:40,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:40,128 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:41:40,129 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:41:40,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:41:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-01-16 18:41:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-01-16 18:41:40,148 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-01-16 18:41:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:40,148 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-01-16 18:41:40,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-01-16 18:41:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:40,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:40,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:40,150 INFO L426 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1908312601, now seen corresponding path program 1172 times [2020-01-16 18:41:40,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:40,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085276040] [2020-01-16 18:41:40,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:40,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085276040] [2020-01-16 18:41:40,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:40,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:40,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947735130] [2020-01-16 18:41:40,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:40,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:40,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:40,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:40,484 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:41:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:40,635 INFO L93 Difference]: Finished difference Result 1218 states and 4279 transitions. [2020-01-16 18:41:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:40,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:40,638 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:41:40,638 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:41:40,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:41:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-01-16 18:41:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:41:40,659 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:41:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:40,659 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:41:40,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:41:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:40,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:40,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:40,660 INFO L426 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1391463231, now seen corresponding path program 1173 times [2020-01-16 18:41:40,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:40,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394288806] [2020-01-16 18:41:40,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:40,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394288806] [2020-01-16 18:41:40,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:40,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:40,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582431837] [2020-01-16 18:41:40,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:40,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:40,964 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:41:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:41,091 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-01-16 18:41:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:41,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:41,095 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:41:41,095 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:41:41,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:41:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:41:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:41:41,115 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:41,115 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:41:41,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:41:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:41,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:41,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:41,116 INFO L426 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:41,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1929318809, now seen corresponding path program 1174 times [2020-01-16 18:41:41,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:41,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052487596] [2020-01-16 18:41:41,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:41,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052487596] [2020-01-16 18:41:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:41,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:41,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761352107] [2020-01-16 18:41:41,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:41,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:41,427 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:41,581 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-01-16 18:41:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:41,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:41,584 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:41:41,584 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:41,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:41:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:41:41,604 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:41:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:41,604 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:41:41,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:41:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:41,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:41,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] [2020-01-16 18:41:41,605 INFO L426 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1401966335, now seen corresponding path program 1175 times [2020-01-16 18:41:41,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:41,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830335764] [2020-01-16 18:41:41,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:41,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830335764] [2020-01-16 18:41:41,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:41,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608781476] [2020-01-16 18:41:41,924 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:41,925 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:41:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:42,054 INFO L93 Difference]: Finished difference Result 1210 states and 4261 transitions. [2020-01-16 18:41:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:42,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:42,058 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:41:42,058 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:42,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:41:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:41:42,078 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:41:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:42,078 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:41:42,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:41:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:42,079 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:42,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:42,079 INFO L426 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 328880955, now seen corresponding path program 1176 times [2020-01-16 18:41:42,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:42,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576688065] [2020-01-16 18:41:42,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:42,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576688065] [2020-01-16 18:41:42,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:42,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:42,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305991628] [2020-01-16 18:41:42,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:42,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:42,408 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:41:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:42,581 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-01-16 18:41:42,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:42,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:42,584 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:41:42,584 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:41:42,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:41:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 771. [2020-01-16 18:41:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:41:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-01-16 18:41:42,603 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-01-16 18:41:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:42,604 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-01-16 18:41:42,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-01-16 18:41:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:42,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:42,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] [2020-01-16 18:41:42,605 INFO L426 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash 472498085, now seen corresponding path program 1177 times [2020-01-16 18:41:42,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:42,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366887365] [2020-01-16 18:41:42,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:42,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-01-16 18:41:42,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366887365] [2020-01-16 18:41:42,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:42,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:42,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295229022] [2020-01-16 18:41:42,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:42,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:42,956 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-01-16 18:41:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:43,083 INFO L93 Difference]: Finished difference Result 1241 states and 4353 transitions. [2020-01-16 18:41:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:43,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:43,086 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:41:43,086 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:41:43,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:41:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 784. [2020-01-16 18:41:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:41:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-01-16 18:41:43,106 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-01-16 18:41:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:43,106 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-01-16 18:41:43,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-01-16 18:41:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:43,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:43,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:43,107 INFO L426 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash -600587295, now seen corresponding path program 1178 times [2020-01-16 18:41:43,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:43,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732163479] [2020-01-16 18:41:43,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:43,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732163479] [2020-01-16 18:41:43,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:43,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:43,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822114063] [2020-01-16 18:41:43,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:43,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:43,456 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:41:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:43,596 INFO L93 Difference]: Finished difference Result 1242 states and 4349 transitions. [2020-01-16 18:41:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:43,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:43,600 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:41:43,600 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:41:43,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:41:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:41:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:41:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:41:43,620 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:41:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:43,620 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:41:43,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:41:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:43,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:43,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:43,622 INFO L426 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1127939769, now seen corresponding path program 1179 times [2020-01-16 18:41:43,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:43,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084617244] [2020-01-16 18:41:43,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:43,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084617244] [2020-01-16 18:41:43,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:43,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:43,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980018935] [2020-01-16 18:41:43,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:43,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:43,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:43,969 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:41:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:44,097 INFO L93 Difference]: Finished difference Result 1238 states and 4341 transitions. [2020-01-16 18:41:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:44,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:44,100 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:41:44,100 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:41:44,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:41:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 783. [2020-01-16 18:41:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:41:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3107 transitions. [2020-01-16 18:41:44,121 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3107 transitions. Word has length 25 [2020-01-16 18:41:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:44,121 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3107 transitions. [2020-01-16 18:41:44,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3107 transitions. [2020-01-16 18:41:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:44,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:44,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:44,122 INFO L426 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash -590084191, now seen corresponding path program 1180 times [2020-01-16 18:41:44,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:44,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301982444] [2020-01-16 18:41:44,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301982444] [2020-01-16 18:41:44,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:44,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:44,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000332626] [2020-01-16 18:41:44,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:44,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:44,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:44,491 INFO L87 Difference]: Start difference. First operand 783 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:41:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:44,623 INFO L93 Difference]: Finished difference Result 1237 states and 4334 transitions. [2020-01-16 18:41:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:44,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:44,626 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:41:44,627 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:41:44,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:41:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:41:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:41:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-01-16 18:41:44,646 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-01-16 18:41:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:44,647 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-01-16 18:41:44,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-01-16 18:41:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:44,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:44,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:44,648 INFO L426 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1106933561, now seen corresponding path program 1181 times [2020-01-16 18:41:44,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:44,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491660742] [2020-01-16 18:41:44,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:44,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491660742] [2020-01-16 18:41:44,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:44,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:44,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062021040] [2020-01-16 18:41:44,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:44,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:44,998 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:41:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:45,142 INFO L93 Difference]: Finished difference Result 1240 states and 4340 transitions. [2020-01-16 18:41:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:45,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:45,146 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:41:45,146 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:41:45,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:41:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 783. [2020-01-16 18:41:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:41:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-01-16 18:41:45,165 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-01-16 18:41:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:45,166 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-01-16 18:41:45,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-01-16 18:41:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:45,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:45,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:45,167 INFO L426 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 504007397, now seen corresponding path program 1182 times [2020-01-16 18:41:45,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:45,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748349300] [2020-01-16 18:41:45,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:45,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748349300] [2020-01-16 18:41:45,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:45,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:45,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307650835] [2020-01-16 18:41:45,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:45,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:45,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:45,519 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:41:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:45,670 INFO L93 Difference]: Finished difference Result 1238 states and 4331 transitions. [2020-01-16 18:41:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:45,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:45,673 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:41:45,673 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:41:45,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:41:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 773. [2020-01-16 18:41:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:41:45,693 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:41:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:45,693 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:41:45,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:41:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:45,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:45,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:45,694 INFO L426 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash 29598945, now seen corresponding path program 1183 times [2020-01-16 18:41:45,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:45,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946208841] [2020-01-16 18:41:45,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:46,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946208841] [2020-01-16 18:41:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579141498] [2020-01-16 18:41:46,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:46,034 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:41:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:46,182 INFO L93 Difference]: Finished difference Result 1229 states and 4315 transitions. [2020-01-16 18:41:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:46,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:46,185 INFO L225 Difference]: With dead ends: 1229 [2020-01-16 18:41:46,185 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:41:46,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:41:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-01-16 18:41:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-01-16 18:41:46,206 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-01-16 18:41:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:46,206 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-01-16 18:41:46,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-01-16 18:41:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:46,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:46,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:46,207 INFO L426 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1043486435, now seen corresponding path program 1184 times [2020-01-16 18:41:46,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:46,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984908541] [2020-01-16 18:41:46,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:46,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984908541] [2020-01-16 18:41:46,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:46,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:46,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929794338] [2020-01-16 18:41:46,545 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:46,546 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:41:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:46,690 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-01-16 18:41:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:46,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:46,693 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:41:46,693 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:41:46,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:41:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 775. [2020-01-16 18:41:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:41:46,714 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:41:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:46,714 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:41:46,714 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:41:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:46,715 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:46,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:46,715 INFO L426 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -476747321, now seen corresponding path program 1185 times [2020-01-16 18:41:46,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:46,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246092828] [2020-01-16 18:41:46,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:47,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-01-16 18:41:47,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246092828] [2020-01-16 18:41:47,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:47,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:47,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451162795] [2020-01-16 18:41:47,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:47,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:47,040 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:41:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:47,178 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-01-16 18:41:47,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:47,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:47,181 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:41:47,181 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:41:47,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:41:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-01-16 18:41:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:41:47,202 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:41:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:47,202 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:41:47,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:41:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:47,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:47,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:47,203 INFO L426 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1011977123, now seen corresponding path program 1186 times [2020-01-16 18:41:47,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:47,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50765466] [2020-01-16 18:41:47,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:47,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-01-16 18:41:47,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50765466] [2020-01-16 18:41:47,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:47,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:47,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121353347] [2020-01-16 18:41:47,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:47,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:47,526 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:41:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:47,653 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:41:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:47,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:47,656 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:41:47,656 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:41:47,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:41:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-01-16 18:41:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:41:47,676 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:41:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:47,676 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:41:47,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:41:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:47,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:47,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:47,677 INFO L426 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash -455741113, now seen corresponding path program 1187 times [2020-01-16 18:41:47,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:47,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802656876] [2020-01-16 18:41:47,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:48,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802656876] [2020-01-16 18:41:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645593049] [2020-01-16 18:41:48,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:48,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:48,013 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:41:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:48,164 INFO L93 Difference]: Finished difference Result 1222 states and 4293 transitions. [2020-01-16 18:41:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:48,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:48,167 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:41:48,167 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:41:48,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:41:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-01-16 18:41:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:41:48,186 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:48,187 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:41:48,187 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:41:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:48,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:48,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:48,188 INFO L426 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash 82114465, now seen corresponding path program 1188 times [2020-01-16 18:41:48,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:48,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66202622] [2020-01-16 18:41:48,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:48,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66202622] [2020-01-16 18:41:48,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:48,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:48,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143446092] [2020-01-16 18:41:48,524 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:48,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:48,524 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:48,667 INFO L93 Difference]: Finished difference Result 1217 states and 4281 transitions. [2020-01-16 18:41:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:48,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:48,670 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:41:48,670 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:48,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 773. [2020-01-16 18:41:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:41:48,690 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:41:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:48,691 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:41:48,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:41:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:48,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:48,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:48,692 INFO L426 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash 355195169, now seen corresponding path program 1189 times [2020-01-16 18:41:48,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:48,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886066371] [2020-01-16 18:41:48,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:49,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886066371] [2020-01-16 18:41:49,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:49,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:49,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888423296] [2020-01-16 18:41:49,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:49,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:49,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:49,036 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:41:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:49,190 INFO L93 Difference]: Finished difference Result 1223 states and 4299 transitions. [2020-01-16 18:41:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:49,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:49,193 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:41:49,193 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:41:49,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:41:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-01-16 18:41:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-01-16 18:41:49,213 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-01-16 18:41:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:49,213 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-01-16 18:41:49,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-01-16 18:41:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:49,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:49,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:49,214 INFO L426 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 893050747, now seen corresponding path program 1190 times [2020-01-16 18:41:49,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:49,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646347243] [2020-01-16 18:41:49,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:49,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646347243] [2020-01-16 18:41:49,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:49,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:49,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270958647] [2020-01-16 18:41:49,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:49,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:49,558 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:41:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:49,684 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-01-16 18:41:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:49,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:49,687 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:41:49,687 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:41:49,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:41:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-01-16 18:41:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:41:49,707 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:41:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:49,707 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:41:49,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:41:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:49,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:49,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:49,708 INFO L426 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1449286757, now seen corresponding path program 1191 times [2020-01-16 18:41:49,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:49,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114596653] [2020-01-16 18:41:49,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:50,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114596653] [2020-01-16 18:41:50,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:50,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:50,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691987586] [2020-01-16 18:41:50,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:50,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:50,043 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:41:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:50,184 INFO L93 Difference]: Finished difference Result 1217 states and 4282 transitions. [2020-01-16 18:41:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:50,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:50,187 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:41:50,188 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:50,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:41:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:41:50,207 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:41:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:50,207 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:41:50,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:41:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:50,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:50,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:50,209 INFO L426 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash 914056955, now seen corresponding path program 1192 times [2020-01-16 18:41:50,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:50,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973004858] [2020-01-16 18:41:50,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:50,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973004858] [2020-01-16 18:41:50,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:50,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:50,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153501841] [2020-01-16 18:41:50,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:50,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:50,538 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:41:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:50,676 INFO L93 Difference]: Finished difference Result 1213 states and 4272 transitions. [2020-01-16 18:41:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:50,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:50,680 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:41:50,680 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:41:50,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:41:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-01-16 18:41:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:41:50,700 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:41:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:50,700 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:41:50,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:41:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:50,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:50,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:50,701 INFO L426 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1480796069, now seen corresponding path program 1193 times [2020-01-16 18:41:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:50,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425888067] [2020-01-16 18:41:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:51,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425888067] [2020-01-16 18:41:51,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:51,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:51,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250546984] [2020-01-16 18:41:51,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:51,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:51,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:51,035 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:41:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:51,175 INFO L93 Difference]: Finished difference Result 1215 states and 4276 transitions. [2020-01-16 18:41:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:51,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:51,179 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:41:51,179 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:41:51,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:41:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-01-16 18:41:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:41:51,199 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:41:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:51,199 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:41:51,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:41:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:51,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:51,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] [2020-01-16 18:41:51,200 INFO L426 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 407710689, now seen corresponding path program 1194 times [2020-01-16 18:41:51,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:51,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558377906] [2020-01-16 18:41:51,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558377906] [2020-01-16 18:41:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:51,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084656922] [2020-01-16 18:41:51,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:51,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:51,534 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:41:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:51,676 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:41:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:51,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:51,679 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:41:51,680 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:41:51,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:41:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 773. [2020-01-16 18:41:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:41:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-01-16 18:41:51,699 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-01-16 18:41:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:51,700 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-01-16 18:41:51,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-01-16 18:41:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:51,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:51,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:51,701 INFO L426 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -66697763, now seen corresponding path program 1195 times [2020-01-16 18:41:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:51,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423362126] [2020-01-16 18:41:51,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:52,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423362126] [2020-01-16 18:41:52,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:52,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:52,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294198913] [2020-01-16 18:41:52,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:52,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:52,038 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-01-16 18:41:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:52,206 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-01-16 18:41:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:52,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:52,210 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:41:52,210 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:41:52,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:41:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-01-16 18:41:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-01-16 18:41:52,230 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-01-16 18:41:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:52,230 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-01-16 18:41:52,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-01-16 18:41:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:52,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:52,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:52,231 INFO L426 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243195, now seen corresponding path program 1196 times [2020-01-16 18:41:52,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:52,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282072262] [2020-01-16 18:41:52,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:52,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282072262] [2020-01-16 18:41:52,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:52,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:52,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793307041] [2020-01-16 18:41:52,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:52,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:52,565 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:41:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:52,698 INFO L93 Difference]: Finished difference Result 1224 states and 4294 transitions. [2020-01-16 18:41:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:52,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:52,702 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:41:52,702 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:41:52,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:41:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 775. [2020-01-16 18:41:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:41:52,721 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:41:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:52,721 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:41:52,721 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:41:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:52,722 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:52,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:52,722 INFO L426 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1027393825, now seen corresponding path program 1197 times [2020-01-16 18:41:52,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:52,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604402109] [2020-01-16 18:41:52,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:53,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604402109] [2020-01-16 18:41:53,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:53,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:53,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136792006] [2020-01-16 18:41:53,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:53,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:53,046 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:41:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:53,201 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-01-16 18:41:53,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:53,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:53,204 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:41:53,204 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:41:53,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:41:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-01-16 18:41:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:41:53,224 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:41:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:53,224 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:41:53,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:41:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:53,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:53,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:53,225 INFO L426 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1565249403, now seen corresponding path program 1198 times [2020-01-16 18:41:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326446255] [2020-01-16 18:41:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:53,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326446255] [2020-01-16 18:41:53,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:53,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:53,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737468429] [2020-01-16 18:41:53,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:53,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:53,555 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:41:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:53,709 INFO L93 Difference]: Finished difference Result 1215 states and 4274 transitions. [2020-01-16 18:41:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:53,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:53,712 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:41:53,712 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:53,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 775. [2020-01-16 18:41:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:41:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-01-16 18:41:53,733 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-01-16 18:41:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:53,733 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-01-16 18:41:53,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-01-16 18:41:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:53,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:53,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:53,734 INFO L426 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:53,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1037896929, now seen corresponding path program 1199 times [2020-01-16 18:41:53,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:53,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481580293] [2020-01-16 18:41:53,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:54,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481580293] [2020-01-16 18:41:54,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:54,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:54,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982116552] [2020-01-16 18:41:54,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:54,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:54,070 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:41:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:54,199 INFO L93 Difference]: Finished difference Result 1216 states and 4276 transitions. [2020-01-16 18:41:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:54,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:54,202 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:41:54,202 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:41:54,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:41:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:41:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-01-16 18:41:54,237 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-01-16 18:41:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:54,237 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-01-16 18:41:54,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-01-16 18:41:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:54,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:54,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:54,239 INFO L426 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash -35188451, now seen corresponding path program 1200 times [2020-01-16 18:41:54,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:54,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425652069] [2020-01-16 18:41:54,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:54,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-01-16 18:41:54,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425652069] [2020-01-16 18:41:54,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:54,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:54,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167688785] [2020-01-16 18:41:54,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:54,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:54,578 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:41:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:54,727 INFO L93 Difference]: Finished difference Result 1213 states and 4268 transitions. [2020-01-16 18:41:54,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:54,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:54,730 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:41:54,731 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:54,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 769. [2020-01-16 18:41:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:41:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3070 transitions. [2020-01-16 18:41:54,751 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3070 transitions. Word has length 25 [2020-01-16 18:41:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:54,751 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3070 transitions. [2020-01-16 18:41:54,751 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3070 transitions. [2020-01-16 18:41:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:54,752 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:54,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:54,752 INFO L426 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash 765261477, now seen corresponding path program 1201 times [2020-01-16 18:41:54,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:54,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461545141] [2020-01-16 18:41:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:55,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-01-16 18:41:55,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461545141] [2020-01-16 18:41:55,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:55,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:55,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761263358] [2020-01-16 18:41:55,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:55,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:55,105 INFO L87 Difference]: Start difference. First operand 769 states and 3070 transitions. Second operand 10 states. [2020-01-16 18:41:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:55,256 INFO L93 Difference]: Finished difference Result 1206 states and 4266 transitions. [2020-01-16 18:41:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:55,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:55,260 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:41:55,260 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:41:55,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:41:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-01-16 18:41:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:41:55,280 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:41:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:55,280 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:41:55,281 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:41:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:55,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:55,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:55,282 INFO L426 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016195, now seen corresponding path program 1202 times [2020-01-16 18:41:55,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:55,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977475113] [2020-01-16 18:41:55,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:55,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-01-16 18:41:55,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977475113] [2020-01-16 18:41:55,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:55,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:55,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356933624] [2020-01-16 18:41:55,637 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:55,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:55,637 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:41:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:55,771 INFO L93 Difference]: Finished difference Result 1205 states and 4261 transitions. [2020-01-16 18:41:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:55,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:55,774 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:41:55,774 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:41:55,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:41:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:41:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-01-16 18:41:55,793 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-01-16 18:41:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:55,793 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-01-16 18:41:55,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-01-16 18:41:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:55,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:55,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] [2020-01-16 18:41:55,795 INFO L426 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1603671741, now seen corresponding path program 1203 times [2020-01-16 18:41:55,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:55,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119432972] [2020-01-16 18:41:55,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:56,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119432972] [2020-01-16 18:41:56,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:56,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:56,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413402234] [2020-01-16 18:41:56,143 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:56,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:56,143 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:41:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:56,283 INFO L93 Difference]: Finished difference Result 1211 states and 4274 transitions. [2020-01-16 18:41:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:56,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:56,286 INFO L225 Difference]: With dead ends: 1211 [2020-01-16 18:41:56,286 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:41:56,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:41:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-01-16 18:41:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:41:56,307 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:41:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:56,307 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:41:56,307 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:41:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:56,308 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:56,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:56,308 INFO L426 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash -612413919, now seen corresponding path program 1204 times [2020-01-16 18:41:56,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:56,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755248238] [2020-01-16 18:41:56,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755248238] [2020-01-16 18:41:56,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:56,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:56,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162165343] [2020-01-16 18:41:56,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:56,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:56,673 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:41:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:56,827 INFO L93 Difference]: Finished difference Result 1214 states and 4276 transitions. [2020-01-16 18:41:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:56,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:56,830 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:41:56,830 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:56,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:41:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:41:56,850 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:41:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:56,850 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:41:56,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:41:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:56,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:56,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:56,852 INFO L426 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:56,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1884729691, now seen corresponding path program 1205 times [2020-01-16 18:41:56,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:56,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723792475] [2020-01-16 18:41:56,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:57,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723792475] [2020-01-16 18:41:57,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:57,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:57,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522002201] [2020-01-16 18:41:57,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:57,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:57,198 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:41:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:57,327 INFO L93 Difference]: Finished difference Result 1208 states and 4264 transitions. [2020-01-16 18:41:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:57,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:57,330 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:41:57,331 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:41:57,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:41:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-01-16 18:41:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:41:57,352 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:41:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:57,352 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:41:57,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:41:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:57,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:57,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:57,353 INFO L426 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash -273788733, now seen corresponding path program 1206 times [2020-01-16 18:41:57,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:57,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174177428] [2020-01-16 18:41:57,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:57,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-01-16 18:41:57,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174177428] [2020-01-16 18:41:57,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:57,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:57,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215910179] [2020-01-16 18:41:57,693 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:57,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:57,693 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:41:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:57,823 INFO L93 Difference]: Finished difference Result 1212 states and 4269 transitions. [2020-01-16 18:41:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:57,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:57,826 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:41:57,826 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:41:57,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:41:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 774. [2020-01-16 18:41:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:41:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-01-16 18:41:57,848 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-01-16 18:41:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:57,848 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-01-16 18:41:57,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-01-16 18:41:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:57,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:57,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:57,849 INFO L426 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 342775751, now seen corresponding path program 1207 times [2020-01-16 18:41:57,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:57,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144136258] [2020-01-16 18:41:57,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:58,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144136258] [2020-01-16 18:41:58,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:58,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942731293] [2020-01-16 18:41:58,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:58,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:58,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:58,205 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:41:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:58,339 INFO L93 Difference]: Finished difference Result 1204 states and 4259 transitions. [2020-01-16 18:41:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:58,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:58,343 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:41:58,343 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:41:58,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:41:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 780. [2020-01-16 18:41:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:41:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-01-16 18:41:58,363 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-01-16 18:41:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:58,363 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-01-16 18:41:58,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-01-16 18:41:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:58,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:58,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:58,365 INFO L426 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:58,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1323530469, now seen corresponding path program 1208 times [2020-01-16 18:41:58,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:58,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645851111] [2020-01-16 18:41:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:58,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645851111] [2020-01-16 18:41:58,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:58,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:58,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378879627] [2020-01-16 18:41:58,748 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:58,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:58,748 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:41:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:58,919 INFO L93 Difference]: Finished difference Result 1203 states and 4254 transitions. [2020-01-16 18:41:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:58,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:58,923 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:41:58,923 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:41:58,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:41:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-01-16 18:41:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:41:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:41:58,943 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:41:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:58,943 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:41:58,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:41:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:58,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:58,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:58,944 INFO L426 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash -100123389, now seen corresponding path program 1209 times [2020-01-16 18:41:58,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:58,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133616077] [2020-01-16 18:41:58,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:41:59,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133616077] [2020-01-16 18:41:59,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:59,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:59,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432362522] [2020-01-16 18:41:59,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:59,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:59,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:59,304 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:41:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:41:59,473 INFO L93 Difference]: Finished difference Result 1207 states and 4263 transitions. [2020-01-16 18:41:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:41:59,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:41:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:41:59,476 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:41:59,477 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:41:59,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:41:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:41:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:41:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:41:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:41:59,497 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:41:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:41:59,497 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:41:59,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:41:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:41:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:41:59,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:41:59,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:41:59,499 INFO L426 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:41:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:41:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 901637537, now seen corresponding path program 1210 times [2020-01-16 18:41:59,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:41:59,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766700703] [2020-01-16 18:41:59,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:41:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:41:59,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-01-16 18:41:59,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766700703] [2020-01-16 18:41:59,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:41:59,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:41:59,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633825475] [2020-01-16 18:41:59,860 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:41:59,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:41:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:41:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:41:59,860 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:42:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:00,035 INFO L93 Difference]: Finished difference Result 1208 states and 4261 transitions. [2020-01-16 18:42:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:00,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:00,038 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:42:00,038 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:42:00,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:42:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:42:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:42:00,058 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:42:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:00,058 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:42:00,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:42:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:00,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:00,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:00,059 INFO L426 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1981619193, now seen corresponding path program 1211 times [2020-01-16 18:42:00,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:00,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082491454] [2020-01-16 18:42:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:00,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082491454] [2020-01-16 18:42:00,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:00,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:00,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967177049] [2020-01-16 18:42:00,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:00,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:00,411 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:42:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:00,562 INFO L93 Difference]: Finished difference Result 1204 states and 4253 transitions. [2020-01-16 18:42:00,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:00,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:00,565 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:42:00,565 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:42:00,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:42:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-01-16 18:42:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-01-16 18:42:00,585 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-01-16 18:42:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:00,585 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-01-16 18:42:00,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-01-16 18:42:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:00,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:00,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:00,586 INFO L426 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1240262723, now seen corresponding path program 1212 times [2020-01-16 18:42:00,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:00,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594889558] [2020-01-16 18:42:00,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:00,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594889558] [2020-01-16 18:42:00,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:00,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:00,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102607307] [2020-01-16 18:42:00,952 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:00,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:00,953 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:42:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:01,125 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-01-16 18:42:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:01,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:01,128 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:42:01,128 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:42:01,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:42:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-01-16 18:42:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:42:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3089 transitions. [2020-01-16 18:42:01,149 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3089 transitions. Word has length 25 [2020-01-16 18:42:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:01,149 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3089 transitions. [2020-01-16 18:42:01,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3089 transitions. [2020-01-16 18:42:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:01,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:01,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:01,150 INFO L426 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1846324103, now seen corresponding path program 1213 times [2020-01-16 18:42:01,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:01,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008281292] [2020-01-16 18:42:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:01,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008281292] [2020-01-16 18:42:01,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:01,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:01,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407703661] [2020-01-16 18:42:01,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:01,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:01,492 INFO L87 Difference]: Start difference. First operand 774 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:42:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:01,660 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-01-16 18:42:01,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:01,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:01,664 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:42:01,664 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:42:01,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:42:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 782. [2020-01-16 18:42:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:42:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3111 transitions. [2020-01-16 18:42:01,684 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3111 transitions. Word has length 25 [2020-01-16 18:42:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:01,684 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3111 transitions. [2020-01-16 18:42:01,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3111 transitions. [2020-01-16 18:42:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:01,686 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:01,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:01,686 INFO L426 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1457385371, now seen corresponding path program 1214 times [2020-01-16 18:42:01,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:01,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213955745] [2020-01-16 18:42:01,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:02,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213955745] [2020-01-16 18:42:02,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:02,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091283182] [2020-01-16 18:42:02,032 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:02,033 INFO L87 Difference]: Start difference. First operand 782 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:42:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:02,201 INFO L93 Difference]: Finished difference Result 1220 states and 4290 transitions. [2020-01-16 18:42:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:02,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:02,205 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:42:02,205 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:42:02,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:42:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 778. [2020-01-16 18:42:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:42:02,225 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:42:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:02,226 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:42:02,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:42:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:02,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:02,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:02,227 INFO L426 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -522609115, now seen corresponding path program 1215 times [2020-01-16 18:42:02,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:02,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406448642] [2020-01-16 18:42:02,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:02,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-01-16 18:42:02,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406448642] [2020-01-16 18:42:02,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:02,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:02,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234883682] [2020-01-16 18:42:02,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:02,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:02,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:02,578 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:42:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:02,714 INFO L93 Difference]: Finished difference Result 1215 states and 4280 transitions. [2020-01-16 18:42:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:02,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:02,717 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:42:02,717 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:42:02,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:42:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-01-16 18:42:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:42:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:42:02,738 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:42:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:02,738 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:42:02,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:42:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:02,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:02,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:02,739 INFO L426 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 479151811, now seen corresponding path program 1216 times [2020-01-16 18:42:02,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:02,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68603273] [2020-01-16 18:42:02,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:03,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68603273] [2020-01-16 18:42:03,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:03,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:03,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934631685] [2020-01-16 18:42:03,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:03,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:03,108 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:42:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:03,282 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-01-16 18:42:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:03,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:03,285 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:42:03,285 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:42:03,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:42:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 778. [2020-01-16 18:42:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:42:03,305 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:03,306 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:42:03,306 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:42:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:03,307 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:03,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:03,307 INFO L426 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash -467567737, now seen corresponding path program 1217 times [2020-01-16 18:42:03,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:03,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840060459] [2020-01-16 18:42:03,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:03,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-01-16 18:42:03,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840060459] [2020-01-16 18:42:03,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:03,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:03,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886570657] [2020-01-16 18:42:03,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:03,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:03,652 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:03,823 INFO L93 Difference]: Finished difference Result 1222 states and 4291 transitions. [2020-01-16 18:42:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:03,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:03,827 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:42:03,827 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:42:03,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:42:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-01-16 18:42:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:42:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-01-16 18:42:03,848 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-01-16 18:42:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:03,848 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-01-16 18:42:03,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-01-16 18:42:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:03,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:03,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:03,849 INFO L426 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1143373221, now seen corresponding path program 1218 times [2020-01-16 18:42:03,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:03,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378250630] [2020-01-16 18:42:03,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:04,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378250630] [2020-01-16 18:42:04,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:04,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:04,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196394590] [2020-01-16 18:42:04,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:04,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:04,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:04,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:04,197 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:42:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:04,373 INFO L93 Difference]: Finished difference Result 1220 states and 4282 transitions. [2020-01-16 18:42:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:04,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:04,376 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:42:04,376 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:42:04,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:42:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 774. [2020-01-16 18:42:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:42:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3086 transitions. [2020-01-16 18:42:04,396 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:04,396 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3086 transitions. [2020-01-16 18:42:04,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3086 transitions. [2020-01-16 18:42:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:04,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:04,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:04,398 INFO L426 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:04,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1265154109, now seen corresponding path program 1219 times [2020-01-16 18:42:04,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:04,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699357976] [2020-01-16 18:42:04,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:04,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699357976] [2020-01-16 18:42:04,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:04,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:04,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696262800] [2020-01-16 18:42:04,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:04,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:04,732 INFO L87 Difference]: Start difference. First operand 774 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:04,901 INFO L93 Difference]: Finished difference Result 1210 states and 4266 transitions. [2020-01-16 18:42:04,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:04,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:04,904 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:42:04,905 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:42:04,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:42:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-01-16 18:42:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-01-16 18:42:04,925 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-01-16 18:42:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:04,925 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-01-16 18:42:04,925 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-01-16 18:42:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:04,926 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:04,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:04,926 INFO L426 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 345786849, now seen corresponding path program 1220 times [2020-01-16 18:42:04,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:04,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337325286] [2020-01-16 18:42:04,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:05,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337325286] [2020-01-16 18:42:05,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:05,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:05,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280099273] [2020-01-16 18:42:05,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:05,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:05,271 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:42:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:05,407 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-01-16 18:42:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:05,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:05,423 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:42:05,423 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:42:05,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:42:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-01-16 18:42:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:42:05,442 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:05,442 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:42:05,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:42:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:05,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:05,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:05,443 INFO L426 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1429375333, now seen corresponding path program 1221 times [2020-01-16 18:42:05,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:05,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254027325] [2020-01-16 18:42:05,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:05,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254027325] [2020-01-16 18:42:05,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:05,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:05,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121320140] [2020-01-16 18:42:05,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:05,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:05,781 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:05,930 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-01-16 18:42:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:05,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:05,933 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:42:05,933 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:42:05,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:42:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-01-16 18:42:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-01-16 18:42:05,953 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-01-16 18:42:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:05,954 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-01-16 18:42:05,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-01-16 18:42:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:05,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:05,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:05,955 INFO L426 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 356289953, now seen corresponding path program 1222 times [2020-01-16 18:42:05,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:05,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439336541] [2020-01-16 18:42:05,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:06,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439336541] [2020-01-16 18:42:06,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:06,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:06,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947662828] [2020-01-16 18:42:06,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:06,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:06,298 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:42:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:06,468 INFO L93 Difference]: Finished difference Result 1210 states and 4260 transitions. [2020-01-16 18:42:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:06,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:06,472 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:42:06,472 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:42:06,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:42:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:42:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-01-16 18:42:06,491 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-01-16 18:42:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:06,491 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-01-16 18:42:06,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-01-16 18:42:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:06,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:06,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:06,492 INFO L426 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1439878437, now seen corresponding path program 1223 times [2020-01-16 18:42:06,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:06,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348428796] [2020-01-16 18:42:06,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:06,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-01-16 18:42:06,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348428796] [2020-01-16 18:42:06,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:06,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:06,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858997549] [2020-01-16 18:42:06,834 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:06,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:06,835 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:42:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:06,974 INFO L93 Difference]: Finished difference Result 1218 states and 4278 transitions. [2020-01-16 18:42:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:06,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:06,977 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:42:06,977 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:42:06,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:42:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-01-16 18:42:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:42:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-01-16 18:42:06,998 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-01-16 18:42:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:06,998 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-01-16 18:42:06,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-01-16 18:42:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:06,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:07,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:07,000 INFO L426 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:07,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1244147901, now seen corresponding path program 1224 times [2020-01-16 18:42:07,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:07,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263934676] [2020-01-16 18:42:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:07,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263934676] [2020-01-16 18:42:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:07,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:07,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023299303] [2020-01-16 18:42:07,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:07,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:07,341 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:42:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:07,517 INFO L93 Difference]: Finished difference Result 1216 states and 4269 transitions. [2020-01-16 18:42:07,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:07,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:07,520 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:42:07,520 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:42:07,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:42:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 771. [2020-01-16 18:42:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:42:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:42:07,540 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:42:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:07,540 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:42:07,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:42:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:07,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:07,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:07,541 INFO L426 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 340950241, now seen corresponding path program 1225 times [2020-01-16 18:42:07,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:07,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180568219] [2020-01-16 18:42:07,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:07,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180568219] [2020-01-16 18:42:07,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:07,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:07,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558320479] [2020-01-16 18:42:07,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:07,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:07,908 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:42:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:08,062 INFO L93 Difference]: Finished difference Result 1192 states and 4219 transitions. [2020-01-16 18:42:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:08,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:08,065 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:08,065 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:42:08,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:42:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-01-16 18:42:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:42:08,085 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:42:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:08,086 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:42:08,086 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:42:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:08,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:08,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:08,087 INFO L426 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1321704959, now seen corresponding path program 1226 times [2020-01-16 18:42:08,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:08,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061387119] [2020-01-16 18:42:08,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:08,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061387119] [2020-01-16 18:42:08,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:08,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:08,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765196359] [2020-01-16 18:42:08,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:08,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:08,437 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:42:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:08,612 INFO L93 Difference]: Finished difference Result 1191 states and 4214 transitions. [2020-01-16 18:42:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:08,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:08,615 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:42:08,615 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:08,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-01-16 18:42:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:42:08,635 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:08,635 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:42:08,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:42:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:08,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:08,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:08,636 INFO L426 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2027982977, now seen corresponding path program 1227 times [2020-01-16 18:42:08,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:08,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248085553] [2020-01-16 18:42:08,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:08,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248085553] [2020-01-16 18:42:08,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:08,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:08,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723638401] [2020-01-16 18:42:08,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:08,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:08,985 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:09,156 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-01-16 18:42:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:09,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:09,159 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:42:09,159 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:42:09,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:42:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 780. [2020-01-16 18:42:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:42:09,179 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:42:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:09,179 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:42:09,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:42:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:09,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:09,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:09,180 INFO L426 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1036725155, now seen corresponding path program 1228 times [2020-01-16 18:42:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:09,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891931326] [2020-01-16 18:42:09,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:09,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891931326] [2020-01-16 18:42:09,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:09,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:09,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876016853] [2020-01-16 18:42:09,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:09,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:09,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:09,527 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:42:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:09,702 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:42:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:09,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:09,705 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:42:09,705 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:42:09,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:42:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 776. [2020-01-16 18:42:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:42:09,726 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:42:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:09,726 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:42:09,726 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:42:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:09,727 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:09,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:09,727 INFO L426 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1985926369, now seen corresponding path program 1229 times [2020-01-16 18:42:09,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:09,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871722782] [2020-01-16 18:42:09,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:10,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-01-16 18:42:10,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871722782] [2020-01-16 18:42:10,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:10,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:10,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814348120] [2020-01-16 18:42:10,075 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:10,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:10,076 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:42:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:10,256 INFO L93 Difference]: Finished difference Result 1194 states and 4217 transitions. [2020-01-16 18:42:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:10,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:10,260 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:42:10,260 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:10,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:42:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:42:10,280 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:10,280 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:42:10,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:42:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:10,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:10,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:10,281 INFO L426 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -698099969, now seen corresponding path program 1230 times [2020-01-16 18:42:10,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:10,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997161884] [2020-01-16 18:42:10,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:10,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-01-16 18:42:10,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997161884] [2020-01-16 18:42:10,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:10,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:10,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932321134] [2020-01-16 18:42:10,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:10,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:10,627 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:42:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:10,748 INFO L93 Difference]: Finished difference Result 1198 states and 4222 transitions. [2020-01-16 18:42:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:10,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:10,751 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:42:10,751 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:10,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 773. [2020-01-16 18:42:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:42:10,770 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:10,770 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:42:10,770 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:42:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:10,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:10,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:10,771 INFO L426 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash -926506937, now seen corresponding path program 1231 times [2020-01-16 18:42:10,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:10,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126512314] [2020-01-16 18:42:10,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:11,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126512314] [2020-01-16 18:42:11,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:11,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:11,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118325076] [2020-01-16 18:42:11,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:11,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:11,125 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:11,249 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-01-16 18:42:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:11,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:11,253 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:42:11,253 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:11,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-01-16 18:42:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:42:11,273 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:11,273 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:42:11,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:42:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:11,274 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:11,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:11,274 INFO L426 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 54247781, now seen corresponding path program 1232 times [2020-01-16 18:42:11,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:11,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493523238] [2020-01-16 18:42:11,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:11,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-01-16 18:42:11,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493523238] [2020-01-16 18:42:11,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:11,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:11,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415331991] [2020-01-16 18:42:11,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:11,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:11,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:11,634 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:42:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:11,757 INFO L93 Difference]: Finished difference Result 1182 states and 4189 transitions. [2020-01-16 18:42:11,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:11,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:11,760 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:11,760 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:42:11,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:42:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-01-16 18:42:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:42:11,780 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:42:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:11,780 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:42:11,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:42:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:11,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:11,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:11,782 INFO L426 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1812305217, now seen corresponding path program 1233 times [2020-01-16 18:42:11,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:11,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265866244] [2020-01-16 18:42:11,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:12,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265866244] [2020-01-16 18:42:12,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:12,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:12,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004434824] [2020-01-16 18:42:12,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:12,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:12,129 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:42:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:12,265 INFO L93 Difference]: Finished difference Result 1181 states and 4187 transitions. [2020-01-16 18:42:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:12,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:12,269 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:42:12,269 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:12,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:42:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:42:12,289 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:12,289 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:42:12,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:42:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:12,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:12,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:12,290 INFO L426 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -789538083, now seen corresponding path program 1234 times [2020-01-16 18:42:12,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:12,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842170972] [2020-01-16 18:42:12,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:12,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842170972] [2020-01-16 18:42:12,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:12,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:12,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837632943] [2020-01-16 18:42:12,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:12,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:12,660 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:12,786 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-01-16 18:42:12,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:12,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:12,789 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:42:12,789 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:42:12,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:42:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:42:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:42:12,809 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:42:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:12,810 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:42:12,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:42:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:12,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:12,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:12,811 INFO L426 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1695257863, now seen corresponding path program 1235 times [2020-01-16 18:42:12,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:12,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308773737] [2020-01-16 18:42:12,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:13,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-01-16 18:42:13,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308773737] [2020-01-16 18:42:13,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:13,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:13,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837235869] [2020-01-16 18:42:13,173 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:13,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:13,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:13,174 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:42:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:13,309 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-01-16 18:42:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:13,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:13,312 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:42:13,312 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:42:13,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:42:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-01-16 18:42:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:42:13,332 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:13,332 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:42:13,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:42:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:13,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:13,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:13,334 INFO L426 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -450912897, now seen corresponding path program 1236 times [2020-01-16 18:42:13,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:13,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135947278] [2020-01-16 18:42:13,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:13,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135947278] [2020-01-16 18:42:13,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:13,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:13,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067032928] [2020-01-16 18:42:13,692 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:13,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:13,693 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:13,818 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-01-16 18:42:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:13,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:13,822 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:42:13,822 INFO L226 Difference]: Without dead ends: 1163 [2020-01-16 18:42:13,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-01-16 18:42:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 773. [2020-01-16 18:42:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:42:13,843 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:42:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:13,843 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:42:13,843 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:42:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:13,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:13,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:13,844 INFO L426 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash 577041415, now seen corresponding path program 1237 times [2020-01-16 18:42:13,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:13,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952058461] [2020-01-16 18:42:13,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:14,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952058461] [2020-01-16 18:42:14,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:14,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:14,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579479109] [2020-01-16 18:42:14,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:14,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:14,192 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:42:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:14,313 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:42:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:14,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:14,316 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:42:14,316 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:42:14,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:42:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-01-16 18:42:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:42:14,336 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:14,336 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:42:14,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:42:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:14,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:14,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:14,337 INFO L426 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1568299237, now seen corresponding path program 1238 times [2020-01-16 18:42:14,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:14,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908373389] [2020-01-16 18:42:14,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:14,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908373389] [2020-01-16 18:42:14,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:14,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:14,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780426975] [2020-01-16 18:42:14,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:14,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:14,682 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:42:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:14,805 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-01-16 18:42:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:14,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:14,808 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:42:14,809 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:14,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:42:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:42:14,829 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:42:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:14,830 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:42:14,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:42:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:14,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:14,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:14,831 INFO L426 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2060176353, now seen corresponding path program 1239 times [2020-01-16 18:42:14,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:14,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394096402] [2020-01-16 18:42:14,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:15,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394096402] [2020-01-16 18:42:15,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:15,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:15,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899270798] [2020-01-16 18:42:15,188 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:15,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:15,189 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:42:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:15,307 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-01-16 18:42:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:15,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:15,311 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:42:15,311 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:42:15,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:42:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-01-16 18:42:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:42:15,331 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:15,331 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:42:15,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:42:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:15,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:15,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:15,332 INFO L426 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1212023809, now seen corresponding path program 1240 times [2020-01-16 18:42:15,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:15,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531450676] [2020-01-16 18:42:15,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:15,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531450676] [2020-01-16 18:42:15,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:15,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:15,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386251909] [2020-01-16 18:42:15,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:15,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:15,676 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:15,799 INFO L93 Difference]: Finished difference Result 1184 states and 4190 transitions. [2020-01-16 18:42:15,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:15,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:15,803 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:42:15,803 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:42:15,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:42:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:42:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:42:15,823 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:15,823 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:42:15,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:42:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:15,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:15,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:15,824 INFO L426 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1085657977, now seen corresponding path program 1241 times [2020-01-16 18:42:15,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:15,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978343021] [2020-01-16 18:42:15,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:16,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978343021] [2020-01-16 18:42:16,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:16,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:16,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112820092] [2020-01-16 18:42:16,161 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:16,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:16,161 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:16,283 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-01-16 18:42:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:16,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:16,287 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:16,287 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:16,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:42:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:42:16,306 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:16,307 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:42:16,307 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:42:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:16,308 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:16,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:16,308 INFO L426 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -547802399, now seen corresponding path program 1242 times [2020-01-16 18:42:16,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:16,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012986072] [2020-01-16 18:42:16,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:16,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-01-16 18:42:16,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012986072] [2020-01-16 18:42:16,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:16,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:16,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970188955] [2020-01-16 18:42:16,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:16,648 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:16,775 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-01-16 18:42:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:16,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:16,779 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:42:16,779 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:42:16,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:42:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:42:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:42:16,799 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:42:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:16,799 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:42:16,799 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:42:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:16,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:16,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:16,800 INFO L426 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1317631359, now seen corresponding path program 1243 times [2020-01-16 18:42:16,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:16,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675365860] [2020-01-16 18:42:16,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:17,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675365860] [2020-01-16 18:42:17,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:17,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:17,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243061970] [2020-01-16 18:42:17,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:17,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:17,147 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:42:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:17,269 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-01-16 18:42:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:17,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:17,273 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:17,273 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:17,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 778. [2020-01-16 18:42:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:42:17,307 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:17,307 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:42:17,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:42:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:17,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:17,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:17,309 INFO L426 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1366394979, now seen corresponding path program 1244 times [2020-01-16 18:42:17,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:17,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888376469] [2020-01-16 18:42:17,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:17,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-01-16 18:42:17,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888376469] [2020-01-16 18:42:17,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:17,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:17,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732793460] [2020-01-16 18:42:17,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:17,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:17,652 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:17,770 INFO L93 Difference]: Finished difference Result 1192 states and 4205 transitions. [2020-01-16 18:42:17,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:17,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:17,773 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:17,773 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:42:17,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:42:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:42:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:42:17,792 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:17,792 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:42:17,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:42:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:17,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:17,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:17,794 INFO L426 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 811285093, now seen corresponding path program 1245 times [2020-01-16 18:42:17,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:17,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605008190] [2020-01-16 18:42:17,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:18,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605008190] [2020-01-16 18:42:18,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:18,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319098428] [2020-01-16 18:42:18,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:18,148 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:18,264 INFO L93 Difference]: Finished difference Result 1182 states and 4185 transitions. [2020-01-16 18:42:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:18,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:18,267 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:18,267 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:18,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:42:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:42:18,286 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:18,286 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:42:18,287 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:42:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:18,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:18,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:18,288 INFO L426 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1334885667, now seen corresponding path program 1246 times [2020-01-16 18:42:18,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:18,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861219703] [2020-01-16 18:42:18,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:18,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861219703] [2020-01-16 18:42:18,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:18,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:18,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790160110] [2020-01-16 18:42:18,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:18,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:18,642 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:18,765 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-01-16 18:42:18,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:18,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:18,769 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:42:18,769 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:18,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:42:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:18,789 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:18,789 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:18,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:18,790 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:18,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:18,791 INFO L426 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 821788197, now seen corresponding path program 1247 times [2020-01-16 18:42:18,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:18,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072087274] [2020-01-16 18:42:18,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:19,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072087274] [2020-01-16 18:42:19,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:19,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:19,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908867913] [2020-01-16 18:42:19,127 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:19,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:19,128 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:19,245 INFO L93 Difference]: Finished difference Result 1190 states and 4199 transitions. [2020-01-16 18:42:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:19,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:19,248 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:42:19,248 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:42:19,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:42:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 777. [2020-01-16 18:42:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:19,268 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:19,269 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:19,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:19,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:19,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:19,270 INFO L426 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1359643775, now seen corresponding path program 1248 times [2020-01-16 18:42:19,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:19,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489536774] [2020-01-16 18:42:19,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:19,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-01-16 18:42:19,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489536774] [2020-01-16 18:42:19,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:19,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:19,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851641433] [2020-01-16 18:42:19,609 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:19,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:19,610 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:19,755 INFO L93 Difference]: Finished difference Result 1185 states and 4187 transitions. [2020-01-16 18:42:19,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:19,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:19,758 INFO L225 Difference]: With dead ends: 1185 [2020-01-16 18:42:19,758 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:19,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 771. [2020-01-16 18:42:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:42:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:42:19,778 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:42:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:19,778 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:42:19,778 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:42:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:19,779 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:19,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:19,780 INFO L426 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash -293691103, now seen corresponding path program 1249 times [2020-01-16 18:42:19,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:19,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246756845] [2020-01-16 18:42:19,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:20,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246756845] [2020-01-16 18:42:20,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:20,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:20,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093192382] [2020-01-16 18:42:20,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:20,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:20,140 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:42:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:20,265 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-01-16 18:42:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:20,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:20,268 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:20,268 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:42:20,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:42:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-01-16 18:42:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:42:20,287 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:42:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:20,287 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:42:20,287 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:42:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:20,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:20,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:20,288 INFO L426 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 687063615, now seen corresponding path program 1250 times [2020-01-16 18:42:20,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:20,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887983179] [2020-01-16 18:42:20,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:20,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-01-16 18:42:20,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887983179] [2020-01-16 18:42:20,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:20,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:20,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577878993] [2020-01-16 18:42:20,653 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:20,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:20,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:20,653 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:42:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:20,777 INFO L93 Difference]: Finished difference Result 1187 states and 4204 transitions. [2020-01-16 18:42:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:20,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:20,780 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:42:20,781 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:42:20,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:42:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 776. [2020-01-16 18:42:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-01-16 18:42:20,801 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:20,801 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-01-16 18:42:20,801 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-01-16 18:42:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:20,802 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:20,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:20,802 INFO L426 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash -736590243, now seen corresponding path program 1251 times [2020-01-16 18:42:20,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:20,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431641952] [2020-01-16 18:42:20,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:21,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-01-16 18:42:21,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431641952] [2020-01-16 18:42:21,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:21,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:21,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565244880] [2020-01-16 18:42:21,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:21,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:21,164 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:21,286 INFO L93 Difference]: Finished difference Result 1191 states and 4213 transitions. [2020-01-16 18:42:21,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:21,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:21,289 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:42:21,289 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:21,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 780. [2020-01-16 18:42:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3101 transitions. [2020-01-16 18:42:21,309 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3101 transitions. Word has length 25 [2020-01-16 18:42:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:21,309 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3101 transitions. [2020-01-16 18:42:21,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3101 transitions. [2020-01-16 18:42:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:21,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:21,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:21,311 INFO L426 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 265170683, now seen corresponding path program 1252 times [2020-01-16 18:42:21,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:21,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107207869] [2020-01-16 18:42:21,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:21,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107207869] [2020-01-16 18:42:21,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:21,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:21,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987202374] [2020-01-16 18:42:21,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:21,675 INFO L87 Difference]: Start difference. First operand 780 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:42:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:21,802 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-01-16 18:42:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:21,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:21,805 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:21,805 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:42:21,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:42:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 776. [2020-01-16 18:42:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-01-16 18:42:21,826 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-01-16 18:42:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:21,826 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-01-16 18:42:21,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-01-16 18:42:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:21,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:21,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:21,827 INFO L426 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1676881249, now seen corresponding path program 1253 times [2020-01-16 18:42:21,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:21,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173991675] [2020-01-16 18:42:21,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:22,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173991675] [2020-01-16 18:42:22,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:22,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:22,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274574916] [2020-01-16 18:42:22,181 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:22,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:22,181 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:42:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:22,310 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-01-16 18:42:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:22,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:22,313 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:22,314 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:22,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-01-16 18:42:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:42:22,334 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:22,334 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:42:22,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:42:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:22,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:22,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:22,335 INFO L426 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 603795869, now seen corresponding path program 1254 times [2020-01-16 18:42:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720667529] [2020-01-16 18:42:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:22,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-01-16 18:42:22,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720667529] [2020-01-16 18:42:22,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:22,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:22,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267997980] [2020-01-16 18:42:22,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:22,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:22,688 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:22,814 INFO L93 Difference]: Finished difference Result 1190 states and 4204 transitions. [2020-01-16 18:42:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:22,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:22,817 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:42:22,817 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:22,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 773. [2020-01-16 18:42:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:42:22,837 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:42:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:22,837 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:42:22,837 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:42:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:22,838 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:22,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:22,838 INFO L426 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1138662555, now seen corresponding path program 1255 times [2020-01-16 18:42:22,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:22,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905486739] [2020-01-16 18:42:22,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:23,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905486739] [2020-01-16 18:42:23,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:23,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:23,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114015677] [2020-01-16 18:42:23,196 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:23,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:23,196 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:42:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:23,322 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-01-16 18:42:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:23,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:23,325 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:42:23,325 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:23,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-01-16 18:42:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:42:23,345 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:23,345 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:42:23,345 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:42:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:23,346 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:23,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:23,347 INFO L426 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -157907837, now seen corresponding path program 1256 times [2020-01-16 18:42:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:23,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454726617] [2020-01-16 18:42:23,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:23,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454726617] [2020-01-16 18:42:23,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:23,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:23,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738891911] [2020-01-16 18:42:23,710 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:23,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:23,711 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:23,840 INFO L93 Difference]: Finished difference Result 1180 states and 4183 transitions. [2020-01-16 18:42:23,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:23,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:23,844 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:42:23,844 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:42:23,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:42:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-01-16 18:42:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:42:23,863 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:42:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:23,863 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:42:23,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:42:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:23,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:23,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:23,864 INFO L426 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2024460835, now seen corresponding path program 1257 times [2020-01-16 18:42:23,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:23,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801509719] [2020-01-16 18:42:23,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:24,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801509719] [2020-01-16 18:42:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:24,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:24,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705160542] [2020-01-16 18:42:24,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:24,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:24,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:24,217 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:42:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:24,343 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-01-16 18:42:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:24,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:24,346 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:42:24,346 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:42:24,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:42:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-01-16 18:42:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:42:24,368 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:24,368 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:42:24,368 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:42:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:24,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:24,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:24,369 INFO L426 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:24,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:24,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1001693701, now seen corresponding path program 1258 times [2020-01-16 18:42:24,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:24,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917339227] [2020-01-16 18:42:24,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:24,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917339227] [2020-01-16 18:42:24,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:24,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:24,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037437519] [2020-01-16 18:42:24,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:24,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:24,737 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:24,869 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-01-16 18:42:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:24,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:24,872 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:42:24,872 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:42:24,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:42:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:42:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:42:24,893 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:24,893 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:42:24,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:42:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:24,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:24,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:24,894 INFO L426 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1483102245, now seen corresponding path program 1259 times [2020-01-16 18:42:24,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:24,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796743077] [2020-01-16 18:42:24,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:25,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796743077] [2020-01-16 18:42:25,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:25,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:25,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540294787] [2020-01-16 18:42:25,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:25,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:25,258 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:25,384 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-01-16 18:42:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:25,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:25,388 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:42:25,388 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:42:25,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:42:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:42:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:42:25,407 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:25,407 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:42:25,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:42:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:25,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:25,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:25,409 INFO L426 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash -663068515, now seen corresponding path program 1260 times [2020-01-16 18:42:25,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:25,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432074974] [2020-01-16 18:42:25,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:25,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432074974] [2020-01-16 18:42:25,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:25,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:25,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707646707] [2020-01-16 18:42:25,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:25,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:25,770 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:25,918 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-01-16 18:42:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:25,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:25,921 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:42:25,921 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:42:25,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:42:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-01-16 18:42:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:42:25,940 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:42:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:25,941 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:42:25,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:42:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:25,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:25,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:25,942 INFO L426 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1868434149, now seen corresponding path program 1261 times [2020-01-16 18:42:25,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:25,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290943449] [2020-01-16 18:42:25,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:26,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-01-16 18:42:26,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290943449] [2020-01-16 18:42:26,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:26,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:26,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808123331] [2020-01-16 18:42:26,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:26,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:26,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:26,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:26,297 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:42:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:26,425 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-01-16 18:42:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:26,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:26,429 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:42:26,429 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:42:26,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:42:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-01-16 18:42:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:42:26,450 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:26,450 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:42:26,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:42:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:26,451 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:26,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:26,451 INFO L426 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1424772221, now seen corresponding path program 1262 times [2020-01-16 18:42:26,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:26,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35984054] [2020-01-16 18:42:26,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:26,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35984054] [2020-01-16 18:42:26,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:26,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:26,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88625730] [2020-01-16 18:42:26,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:26,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:26,805 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:26,944 INFO L93 Difference]: Finished difference Result 1188 states and 4198 transitions. [2020-01-16 18:42:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:26,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:26,948 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:26,948 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:26,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:42:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:42:26,969 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:26,969 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:42:26,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:42:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:26,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:26,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:26,970 INFO L426 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1425535009, now seen corresponding path program 1263 times [2020-01-16 18:42:26,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803951975] [2020-01-16 18:42:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:27,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803951975] [2020-01-16 18:42:27,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:27,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:27,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940283024] [2020-01-16 18:42:27,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:27,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:27,333 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:27,494 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-01-16 18:42:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:27,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:27,497 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:27,497 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:42:27,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:42:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:42:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:42:27,517 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:27,517 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:42:27,517 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:42:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:27,518 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:27,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:27,518 INFO L426 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1846665153, now seen corresponding path program 1264 times [2020-01-16 18:42:27,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:27,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920809898] [2020-01-16 18:42:27,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:27,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920809898] [2020-01-16 18:42:27,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:27,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:27,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005406163] [2020-01-16 18:42:27,875 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:27,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:27,876 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:28,005 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:42:28,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:28,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:28,008 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:42:28,008 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:42:28,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:42:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-01-16 18:42:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:28,028 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:28,028 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:28,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:28,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:28,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:28,029 INFO L426 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash 216237861, now seen corresponding path program 1265 times [2020-01-16 18:42:28,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:28,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192118466] [2020-01-16 18:42:28,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:28,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192118466] [2020-01-16 18:42:28,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:28,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:28,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516097235] [2020-01-16 18:42:28,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:28,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:28,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:28,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:28,377 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:28,519 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-01-16 18:42:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:28,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:28,523 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:42:28,523 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:28,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:42:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:28,544 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:28,544 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:28,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:28,545 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:28,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:28,545 INFO L426 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -856847519, now seen corresponding path program 1266 times [2020-01-16 18:42:28,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:28,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897596777] [2020-01-16 18:42:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:28,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897596777] [2020-01-16 18:42:28,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:28,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:28,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885085094] [2020-01-16 18:42:28,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:28,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:28,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:28,893 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:29,057 INFO L93 Difference]: Finished difference Result 1181 states and 4180 transitions. [2020-01-16 18:42:29,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:29,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:29,060 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:42:29,060 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:42:29,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:42:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 773. [2020-01-16 18:42:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:42:29,081 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:42:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:29,081 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:42:29,081 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:42:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:29,082 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:29,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:29,082 INFO L426 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1008586239, now seen corresponding path program 1267 times [2020-01-16 18:42:29,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:29,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832313201] [2020-01-16 18:42:29,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:29,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832313201] [2020-01-16 18:42:29,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:29,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:29,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520081314] [2020-01-16 18:42:29,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:29,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:29,432 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:42:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:29,563 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-01-16 18:42:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:29,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:29,566 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:29,566 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:29,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-01-16 18:42:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-01-16 18:42:29,586 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:29,586 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-01-16 18:42:29,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-01-16 18:42:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:29,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:29,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:29,588 INFO L426 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash -64499141, now seen corresponding path program 1268 times [2020-01-16 18:42:29,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:29,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943887860] [2020-01-16 18:42:29,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:29,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-01-16 18:42:29,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943887860] [2020-01-16 18:42:29,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:29,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:29,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320096528] [2020-01-16 18:42:29,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:29,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:29,947 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:30,093 INFO L93 Difference]: Finished difference Result 1184 states and 4187 transitions. [2020-01-16 18:42:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:30,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:30,096 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:42:30,096 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:42:30,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:42:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-01-16 18:42:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:30,117 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:30,117 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:30,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:30,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:30,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:30,118 INFO L426 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2102677827, now seen corresponding path program 1269 times [2020-01-16 18:42:30,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:30,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520650943] [2020-01-16 18:42:30,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:30,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520650943] [2020-01-16 18:42:30,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:30,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:30,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101172371] [2020-01-16 18:42:30,485 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:30,485 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:30,609 INFO L93 Difference]: Finished difference Result 1178 states and 4175 transitions. [2020-01-16 18:42:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:30,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:30,613 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:42:30,613 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:42:30,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:42:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-01-16 18:42:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:30,633 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:30,633 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:30,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:30,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:30,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:30,634 INFO L426 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -43492933, now seen corresponding path program 1270 times [2020-01-16 18:42:30,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:30,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754847814] [2020-01-16 18:42:30,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:30,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754847814] [2020-01-16 18:42:30,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:30,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:30,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585373579] [2020-01-16 18:42:30,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:30,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:30,991 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:31,124 INFO L93 Difference]: Finished difference Result 1177 states and 4171 transitions. [2020-01-16 18:42:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:31,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:31,128 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:42:31,128 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:42:31,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:42:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:42:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:42:31,148 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:42:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:31,148 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:42:31,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:42:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:31,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:31,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:31,150 INFO L426 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2123684035, now seen corresponding path program 1271 times [2020-01-16 18:42:31,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:31,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133994436] [2020-01-16 18:42:31,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133994436] [2020-01-16 18:42:31,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:31,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:31,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127696890] [2020-01-16 18:42:31,502 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:31,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:31,502 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:42:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:31,629 INFO L93 Difference]: Finished difference Result 1182 states and 4181 transitions. [2020-01-16 18:42:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:31,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:31,632 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:31,632 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:31,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:42:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:42:31,652 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:31,653 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:42:31,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:42:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:31,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:31,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:31,654 INFO L426 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:31,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1050598655, now seen corresponding path program 1272 times [2020-01-16 18:42:31,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:31,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477849716] [2020-01-16 18:42:31,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:32,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477849716] [2020-01-16 18:42:32,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:32,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:32,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949061060] [2020-01-16 18:42:32,003 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:32,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:32,003 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:32,152 INFO L93 Difference]: Finished difference Result 1179 states and 4173 transitions. [2020-01-16 18:42:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:32,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:32,155 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:42:32,155 INFO L226 Difference]: Without dead ends: 1162 [2020-01-16 18:42:32,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-01-16 18:42:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 771. [2020-01-16 18:42:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:42:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-01-16 18:42:32,174 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-01-16 18:42:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:32,174 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-01-16 18:42:32,174 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-01-16 18:42:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:32,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:32,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:32,176 INFO L426 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 997701631, now seen corresponding path program 1273 times [2020-01-16 18:42:32,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:32,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124897289] [2020-01-16 18:42:32,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:32,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124897289] [2020-01-16 18:42:32,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:32,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:32,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158030832] [2020-01-16 18:42:32,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:32,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:32,511 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-01-16 18:42:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:32,664 INFO L93 Difference]: Finished difference Result 1209 states and 4260 transitions. [2020-01-16 18:42:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:32,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:32,667 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:42:32,667 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:42:32,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:42:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 781. [2020-01-16 18:42:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:42:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-01-16 18:42:32,688 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-01-16 18:42:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:32,688 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-01-16 18:42:32,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-01-16 18:42:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:32,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:32,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:32,690 INFO L426 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1988959453, now seen corresponding path program 1274 times [2020-01-16 18:42:32,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:32,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621965262] [2020-01-16 18:42:32,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:33,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-01-16 18:42:33,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621965262] [2020-01-16 18:42:33,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:33,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:33,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109538187] [2020-01-16 18:42:33,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:33,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:33,016 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:42:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:33,142 INFO L93 Difference]: Finished difference Result 1212 states and 4262 transitions. [2020-01-16 18:42:33,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:33,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:33,145 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:42:33,145 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:42:33,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:42:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-01-16 18:42:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:42:33,165 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:42:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:33,165 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:42:33,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:42:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:33,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:33,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:33,167 INFO L426 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1371231587, now seen corresponding path program 1275 times [2020-01-16 18:42:33,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:33,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224098331] [2020-01-16 18:42:33,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:33,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-01-16 18:42:33,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224098331] [2020-01-16 18:42:33,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:33,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:33,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606248622] [2020-01-16 18:42:33,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:33,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:33,501 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:42:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:33,628 INFO L93 Difference]: Finished difference Result 1207 states and 4252 transitions. [2020-01-16 18:42:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:33,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:33,631 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:42:33,631 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:42:33,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:42:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:42:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:42:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:42:33,653 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:42:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:33,653 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:42:33,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:42:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:33,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:33,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:33,654 INFO L426 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash -369470661, now seen corresponding path program 1276 times [2020-01-16 18:42:33,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:33,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557330233] [2020-01-16 18:42:33,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:33,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557330233] [2020-01-16 18:42:33,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:33,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:33,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603225733] [2020-01-16 18:42:33,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:33,993 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:42:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:34,118 INFO L93 Difference]: Finished difference Result 1208 states and 4250 transitions. [2020-01-16 18:42:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:34,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:34,121 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:42:34,121 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:42:34,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:42:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:42:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-01-16 18:42:34,141 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-01-16 18:42:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:34,141 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-01-16 18:42:34,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-01-16 18:42:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:34,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:34,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:34,142 INFO L426 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190209, now seen corresponding path program 1277 times [2020-01-16 18:42:34,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:34,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622774857] [2020-01-16 18:42:34,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:34,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-01-16 18:42:34,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622774857] [2020-01-16 18:42:34,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:34,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:34,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95943417] [2020-01-16 18:42:34,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:34,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:34,473 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:42:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:34,593 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-01-16 18:42:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:34,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:34,597 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:42:34,597 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:42:34,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:42:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-01-16 18:42:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:42:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-01-16 18:42:34,617 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-01-16 18:42:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:34,618 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-01-16 18:42:34,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-01-16 18:42:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:34,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:34,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:34,619 INFO L426 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 294750749, now seen corresponding path program 1278 times [2020-01-16 18:42:34,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:34,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284648056] [2020-01-16 18:42:34,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:34,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284648056] [2020-01-16 18:42:34,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:34,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:34,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148548389] [2020-01-16 18:42:34,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:34,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:34,951 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:42:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:35,106 INFO L93 Difference]: Finished difference Result 1212 states and 4254 transitions. [2020-01-16 18:42:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:35,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:35,109 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:42:35,109 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:42:35,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:42:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-01-16 18:42:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:42:35,139 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:42:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:35,139 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:42:35,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:42:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:35,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:35,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:35,141 INFO L426 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash 152730179, now seen corresponding path program 1279 times [2020-01-16 18:42:35,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:35,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215763026] [2020-01-16 18:42:35,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:35,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-01-16 18:42:35,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215763026] [2020-01-16 18:42:35,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:35,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:35,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512730289] [2020-01-16 18:42:35,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:35,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:35,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:35,469 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:42:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:35,600 INFO L93 Difference]: Finished difference Result 1199 states and 4229 transitions. [2020-01-16 18:42:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:35,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:35,603 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:42:35,603 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:42:35,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:42:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-01-16 18:42:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:42:35,623 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:35,624 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:42:35,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:42:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:35,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:35,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:35,625 INFO L426 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1143988001, now seen corresponding path program 1280 times [2020-01-16 18:42:35,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:35,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128413823] [2020-01-16 18:42:35,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:35,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128413823] [2020-01-16 18:42:35,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:35,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:35,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55481017] [2020-01-16 18:42:35,953 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:35,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:35,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:35,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:35,953 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:36,081 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-01-16 18:42:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:36,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:36,084 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:42:36,084 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:36,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-01-16 18:42:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:42:36,104 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:36,104 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:42:36,104 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:42:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:36,105 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:36,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:36,106 INFO L426 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1635865117, now seen corresponding path program 1281 times [2020-01-16 18:42:36,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:36,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553985400] [2020-01-16 18:42:36,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:36,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-01-16 18:42:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553985400] [2020-01-16 18:42:36,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:36,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:36,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596753657] [2020-01-16 18:42:36,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:36,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:36,431 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:36,569 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-01-16 18:42:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:36,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:36,573 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:36,573 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:42:36,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:42:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-01-16 18:42:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:42:36,594 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:36,594 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:42:36,594 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:42:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:36,595 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:36,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:36,595 INFO L426 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1636335045, now seen corresponding path program 1282 times [2020-01-16 18:42:36,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:36,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333331371] [2020-01-16 18:42:36,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:36,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333331371] [2020-01-16 18:42:36,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:36,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:36,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112399857] [2020-01-16 18:42:36,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:36,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:36,927 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:37,057 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-01-16 18:42:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:37,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:37,060 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:42:37,060 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:42:37,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:42:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:42:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:37,080 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:37,080 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:37,080 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:37,081 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:37,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:37,081 INFO L426 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1509969213, now seen corresponding path program 1283 times [2020-01-16 18:42:37,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:37,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580611677] [2020-01-16 18:42:37,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:37,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580611677] [2020-01-16 18:42:37,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:37,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:37,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277025031] [2020-01-16 18:42:37,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:37,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:37,401 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:37,522 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-01-16 18:42:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:37,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:37,525 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:42:37,526 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:37,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:42:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:37,546 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:37,546 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:37,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:37,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:37,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:37,547 INFO L426 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash -972113635, now seen corresponding path program 1284 times [2020-01-16 18:42:37,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454721743] [2020-01-16 18:42:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:37,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454721743] [2020-01-16 18:42:37,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:37,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:37,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289602620] [2020-01-16 18:42:37,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:37,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:37,881 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:38,025 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-01-16 18:42:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:38,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:38,029 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:42:38,029 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:38,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-01-16 18:42:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:42:38,049 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:42:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:38,049 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:42:38,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:42:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:38,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:38,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] [2020-01-16 18:42:38,050 INFO L426 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1656278531, now seen corresponding path program 1285 times [2020-01-16 18:42:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:38,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079014494] [2020-01-16 18:42:38,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:38,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079014494] [2020-01-16 18:42:38,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:38,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:38,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036488697] [2020-01-16 18:42:38,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:38,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:38,391 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:42:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:38,543 INFO L93 Difference]: Finished difference Result 1195 states and 4219 transitions. [2020-01-16 18:42:38,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:38,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:38,547 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:42:38,547 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:38,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:42:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-01-16 18:42:38,568 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:38,568 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-01-16 18:42:38,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-01-16 18:42:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:38,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:38,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:38,569 INFO L426 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1636927839, now seen corresponding path program 1286 times [2020-01-16 18:42:38,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:38,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089583036] [2020-01-16 18:42:38,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:38,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089583036] [2020-01-16 18:42:38,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:38,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:38,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335183996] [2020-01-16 18:42:38,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:38,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:38,914 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:39,055 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-01-16 18:42:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:39,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:39,059 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:42:39,059 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:39,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:42:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:39,079 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:39,079 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:39,079 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:39,080 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:39,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:39,080 INFO L426 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1213379391, now seen corresponding path program 1287 times [2020-01-16 18:42:39,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:39,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140725412] [2020-01-16 18:42:39,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:39,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140725412] [2020-01-16 18:42:39,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:39,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:39,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048691795] [2020-01-16 18:42:39,420 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:39,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:39,421 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:39,550 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-01-16 18:42:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:39,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:39,553 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:42:39,553 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:42:39,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:42:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-01-16 18:42:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:39,573 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:39,573 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:39,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:39,574 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:39,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:39,574 INFO L426 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:39,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2058820771, now seen corresponding path program 1288 times [2020-01-16 18:42:39,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:39,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996554263] [2020-01-16 18:42:39,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:39,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-01-16 18:42:39,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996554263] [2020-01-16 18:42:39,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:39,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:39,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210763115] [2020-01-16 18:42:39,910 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:39,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:39,911 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:40,042 INFO L93 Difference]: Finished difference Result 1188 states and 4199 transitions. [2020-01-16 18:42:40,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:40,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:40,046 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:40,046 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:42:40,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:42:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:42:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:42:40,066 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:42:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:40,066 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:42:40,066 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:42:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:40,067 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:40,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] [2020-01-16 18:42:40,067 INFO L426 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash 4082243, now seen corresponding path program 1289 times [2020-01-16 18:42:40,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:40,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355110014] [2020-01-16 18:42:40,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:40,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355110014] [2020-01-16 18:42:40,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:40,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:40,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026445078] [2020-01-16 18:42:40,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:40,397 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:42:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:40,530 INFO L93 Difference]: Finished difference Result 1192 states and 4207 transitions. [2020-01-16 18:42:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:40,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:40,534 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:40,534 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:40,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:42:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:42:40,553 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:40,554 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:42:40,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:42:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:40,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:40,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] [2020-01-16 18:42:40,555 INFO L426 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1069003137, now seen corresponding path program 1290 times [2020-01-16 18:42:40,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:40,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100977731] [2020-01-16 18:42:40,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:40,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-01-16 18:42:40,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100977731] [2020-01-16 18:42:40,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:40,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:40,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141043161] [2020-01-16 18:42:40,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:40,885 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:41,015 INFO L93 Difference]: Finished difference Result 1189 states and 4199 transitions. [2020-01-16 18:42:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:41,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:41,018 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:42:41,018 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:42:41,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:42:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-01-16 18:42:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-01-16 18:42:41,038 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-01-16 18:42:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:41,039 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-01-16 18:42:41,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-01-16 18:42:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:41,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:41,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:41,040 INFO L426 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1984485219, now seen corresponding path program 1291 times [2020-01-16 18:42:41,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:41,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278550927] [2020-01-16 18:42:41,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:41,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278550927] [2020-01-16 18:42:41,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:41,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:41,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974846837] [2020-01-16 18:42:41,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:41,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:41,361 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-01-16 18:42:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:41,487 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-01-16 18:42:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:41,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:41,490 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:42:41,490 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:42:41,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:42:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-01-16 18:42:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-01-16 18:42:41,510 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-01-16 18:42:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:41,510 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-01-16 18:42:41,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-01-16 18:42:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:41,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:41,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:41,511 INFO L426 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash -373544261, now seen corresponding path program 1292 times [2020-01-16 18:42:41,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:41,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127917114] [2020-01-16 18:42:41,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:41,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127917114] [2020-01-16 18:42:41,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:41,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:41,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35055741] [2020-01-16 18:42:41,834 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:41,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:41,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:41,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:41,834 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:42:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:41,986 INFO L93 Difference]: Finished difference Result 1204 states and 4232 transitions. [2020-01-16 18:42:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:41,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:41,991 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:42:41,992 INFO L226 Difference]: Without dead ends: 1185 [2020-01-16 18:42:41,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-01-16 18:42:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 775. [2020-01-16 18:42:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:42:42,012 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:42:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:42,012 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:42:42,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:42:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:42,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:42,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:42,013 INFO L426 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -890393631, now seen corresponding path program 1293 times [2020-01-16 18:42:42,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:42,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735679729] [2020-01-16 18:42:42,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:42,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735679729] [2020-01-16 18:42:42,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:42,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:42,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104627552] [2020-01-16 18:42:42,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:42,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:42,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:42,324 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:42:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:42,470 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-01-16 18:42:42,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:42,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:42,473 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:42:42,473 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:42:42,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:42:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-01-16 18:42:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:42:42,493 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:42,494 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:42:42,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:42:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:42,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:42,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:42,495 INFO L426 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash -352538053, now seen corresponding path program 1294 times [2020-01-16 18:42:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976550236] [2020-01-16 18:42:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:42,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976550236] [2020-01-16 18:42:42,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:42,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:42,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558366198] [2020-01-16 18:42:42,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:42,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:42,803 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:42,932 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-01-16 18:42:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:42,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:42,935 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:42:42,935 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:42,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-01-16 18:42:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-01-16 18:42:42,955 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-01-16 18:42:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:42,955 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-01-16 18:42:42,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-01-16 18:42:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:42,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:42,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:42,956 INFO L426 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash -879890527, now seen corresponding path program 1295 times [2020-01-16 18:42:42,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:42,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167197670] [2020-01-16 18:42:42,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:43,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167197670] [2020-01-16 18:42:43,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:43,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:43,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966320348] [2020-01-16 18:42:43,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:43,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:43,287 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:42:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:43,432 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-01-16 18:42:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:43,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:43,435 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:42:43,435 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:43,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:42:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-01-16 18:42:43,454 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-01-16 18:42:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:43,454 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-01-16 18:42:43,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-01-16 18:42:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:43,455 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:43,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:43,456 INFO L426 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1952975907, now seen corresponding path program 1296 times [2020-01-16 18:42:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:43,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585177767] [2020-01-16 18:42:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:43,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585177767] [2020-01-16 18:42:43,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:43,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:43,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582453809] [2020-01-16 18:42:43,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:43,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:43,775 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:42:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:43,908 INFO L93 Difference]: Finished difference Result 1193 states and 4206 transitions. [2020-01-16 18:42:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:43,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:43,912 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:42:43,912 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:43,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 771. [2020-01-16 18:42:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:42:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-01-16 18:42:43,932 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-01-16 18:42:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:43,932 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-01-16 18:42:43,932 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-01-16 18:42:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:43,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:43,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:43,933 INFO L426 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash -507462939, now seen corresponding path program 1297 times [2020-01-16 18:42:43,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:43,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797524853] [2020-01-16 18:42:43,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:44,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797524853] [2020-01-16 18:42:44,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:44,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:44,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111895966] [2020-01-16 18:42:44,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:44,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:44,248 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-01-16 18:42:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:44,374 INFO L93 Difference]: Finished difference Result 1198 states and 4227 transitions. [2020-01-16 18:42:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:44,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:44,378 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:42:44,378 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:42:44,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:42:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-01-16 18:42:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:42:44,399 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:44,400 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:42:44,400 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:42:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:44,401 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:44,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:44,401 INFO L426 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1103478019, now seen corresponding path program 1298 times [2020-01-16 18:42:44,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:44,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810255814] [2020-01-16 18:42:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:44,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-01-16 18:42:44,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810255814] [2020-01-16 18:42:44,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:44,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:44,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996299852] [2020-01-16 18:42:44,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:44,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:44,716 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:42:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:44,843 INFO L93 Difference]: Finished difference Result 1202 states and 4232 transitions. [2020-01-16 18:42:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:44,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:44,846 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:42:44,846 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:42:44,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:42:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 776. [2020-01-16 18:42:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3090 transitions. [2020-01-16 18:42:44,866 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:44,866 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3090 transitions. [2020-01-16 18:42:44,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3090 transitions. [2020-01-16 18:42:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:44,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:44,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] [2020-01-16 18:42:44,867 INFO L426 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2107900793, now seen corresponding path program 1299 times [2020-01-16 18:42:44,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:44,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642125911] [2020-01-16 18:42:44,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:45,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642125911] [2020-01-16 18:42:45,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:45,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:45,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952232525] [2020-01-16 18:42:45,187 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:45,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:45,187 INFO L87 Difference]: Start difference. First operand 776 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:45,313 INFO L93 Difference]: Finished difference Result 1196 states and 4220 transitions. [2020-01-16 18:42:45,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:45,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:45,316 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:42:45,316 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:42:45,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:42:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-01-16 18:42:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:42:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3095 transitions. [2020-01-16 18:42:45,336 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3095 transitions. Word has length 25 [2020-01-16 18:42:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:45,336 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3095 transitions. [2020-01-16 18:42:45,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3095 transitions. [2020-01-16 18:42:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:45,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:45,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:45,338 INFO L426 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1113981123, now seen corresponding path program 1300 times [2020-01-16 18:42:45,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:45,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678504223] [2020-01-16 18:42:45,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:45,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678504223] [2020-01-16 18:42:45,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:45,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:45,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168991337] [2020-01-16 18:42:45,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:45,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:45,664 INFO L87 Difference]: Start difference. First operand 779 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:42:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:45,793 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-01-16 18:42:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:45,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:45,796 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:42:45,796 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:42:45,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:42:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-01-16 18:42:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:42:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3087 transitions. [2020-01-16 18:42:45,828 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3087 transitions. Word has length 25 [2020-01-16 18:42:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:45,828 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3087 transitions. [2020-01-16 18:42:45,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3087 transitions. [2020-01-16 18:42:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:45,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:45,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:45,830 INFO L426 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2097397689, now seen corresponding path program 1301 times [2020-01-16 18:42:45,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:45,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965025072] [2020-01-16 18:42:45,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:46,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965025072] [2020-01-16 18:42:46,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:46,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:46,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618843203] [2020-01-16 18:42:46,161 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:46,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:46,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:46,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:46,161 INFO L87 Difference]: Start difference. First operand 776 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:42:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:46,284 INFO L93 Difference]: Finished difference Result 1206 states and 4239 transitions. [2020-01-16 18:42:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:46,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:46,288 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:42:46,288 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:42:46,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:42:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 781. [2020-01-16 18:42:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:42:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3096 transitions. [2020-01-16 18:42:46,308 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3096 transitions. Word has length 25 [2020-01-16 18:42:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:46,308 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3096 transitions. [2020-01-16 18:42:46,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3096 transitions. [2020-01-16 18:42:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:46,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:46,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:46,310 INFO L426 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:46,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash -486456731, now seen corresponding path program 1302 times [2020-01-16 18:42:46,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:46,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003121973] [2020-01-16 18:42:46,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:46,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003121973] [2020-01-16 18:42:46,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:46,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:46,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584957554] [2020-01-16 18:42:46,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:46,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:46,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:46,631 INFO L87 Difference]: Start difference. First operand 781 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:42:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:46,766 INFO L93 Difference]: Finished difference Result 1204 states and 4230 transitions. [2020-01-16 18:42:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:46,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:46,770 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:42:46,770 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:42:46,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:42:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:42:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:42:46,790 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:42:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:46,790 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:42:46,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:42:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:46,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:46,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:46,791 INFO L426 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -950362079, now seen corresponding path program 1303 times [2020-01-16 18:42:46,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:46,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250616306] [2020-01-16 18:42:46,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:47,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250616306] [2020-01-16 18:42:47,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:47,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:47,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012506555] [2020-01-16 18:42:47,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:47,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:47,112 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:42:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:47,267 INFO L93 Difference]: Finished difference Result 1190 states and 4203 transitions. [2020-01-16 18:42:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:47,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:47,270 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:42:47,270 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:47,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-01-16 18:42:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-01-16 18:42:47,290 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:47,290 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-01-16 18:42:47,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-01-16 18:42:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:47,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:47,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:47,291 INFO L426 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash 660578879, now seen corresponding path program 1304 times [2020-01-16 18:42:47,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:47,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248017017] [2020-01-16 18:42:47,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:47,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248017017] [2020-01-16 18:42:47,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:47,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:47,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904490666] [2020-01-16 18:42:47,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:47,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:47,613 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:47,748 INFO L93 Difference]: Finished difference Result 1194 states and 4208 transitions. [2020-01-16 18:42:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:47,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:47,751 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:42:47,752 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:42:47,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:42:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:42:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:42:47,771 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:42:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:47,772 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:42:47,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:42:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:47,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:47,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:47,773 INFO L426 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1456708345, now seen corresponding path program 1305 times [2020-01-16 18:42:47,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:47,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182535367] [2020-01-16 18:42:47,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:48,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182535367] [2020-01-16 18:42:48,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:48,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:48,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257751752] [2020-01-16 18:42:48,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:48,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:48,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:48,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:48,107 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:42:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:48,244 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-01-16 18:42:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:48,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:48,247 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:42:48,247 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:42:48,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:42:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:42:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:42:48,267 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:42:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:48,267 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:42:48,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:42:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:48,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:48,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:48,268 INFO L426 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 692088191, now seen corresponding path program 1306 times [2020-01-16 18:42:48,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:48,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413588511] [2020-01-16 18:42:48,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:48,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413588511] [2020-01-16 18:42:48,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:48,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:48,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756914990] [2020-01-16 18:42:48,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:48,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:48,614 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:42:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:48,747 INFO L93 Difference]: Finished difference Result 1183 states and 4184 transitions. [2020-01-16 18:42:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:48,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:48,750 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:42:48,751 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:48,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:42:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:42:48,771 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:42:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:48,771 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:42:48,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:42:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:48,772 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:48,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:48,772 INFO L426 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1446205241, now seen corresponding path program 1307 times [2020-01-16 18:42:48,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:48,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485317984] [2020-01-16 18:42:48,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:49,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485317984] [2020-01-16 18:42:49,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:49,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:49,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836088525] [2020-01-16 18:42:49,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:49,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:49,094 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:42:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:49,234 INFO L93 Difference]: Finished difference Result 1192 states and 4202 transitions. [2020-01-16 18:42:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:49,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:49,237 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:49,237 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:42:49,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:42:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:42:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:42:49,257 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:49,258 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:42:49,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:42:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:49,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:49,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:49,259 INFO L426 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -908349663, now seen corresponding path program 1308 times [2020-01-16 18:42:49,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:49,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000316296] [2020-01-16 18:42:49,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:49,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000316296] [2020-01-16 18:42:49,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:49,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:49,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811829849] [2020-01-16 18:42:49,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:49,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:49,581 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:49,719 INFO L93 Difference]: Finished difference Result 1187 states and 4190 transitions. [2020-01-16 18:42:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:49,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:49,722 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:42:49,722 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:42:49,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:42:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:42:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-01-16 18:42:49,742 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-01-16 18:42:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:49,742 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-01-16 18:42:49,743 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-01-16 18:42:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:49,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:49,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:49,744 INFO L426 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -624765855, now seen corresponding path program 1309 times [2020-01-16 18:42:49,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:49,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257357174] [2020-01-16 18:42:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:50,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257357174] [2020-01-16 18:42:50,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:50,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:50,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779827032] [2020-01-16 18:42:50,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:50,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:50,074 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-01-16 18:42:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:50,230 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-01-16 18:42:50,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:50,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:50,234 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:42:50,234 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:42:50,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:42:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-01-16 18:42:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:42:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-01-16 18:42:50,254 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:50,255 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-01-16 18:42:50,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-01-16 18:42:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:50,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:50,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:50,256 INFO L426 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1697851235, now seen corresponding path program 1310 times [2020-01-16 18:42:50,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:50,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624016403] [2020-01-16 18:42:50,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:50,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624016403] [2020-01-16 18:42:50,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:50,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:50,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879431952] [2020-01-16 18:42:50,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:50,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:50,584 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:50,721 INFO L93 Difference]: Finished difference Result 1188 states and 4194 transitions. [2020-01-16 18:42:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:50,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:50,724 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:42:50,725 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:42:50,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:42:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:42:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:42:50,745 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:42:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:50,745 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:42:50,745 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:42:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:50,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42: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] [2020-01-16 18:42:50,747 INFO L426 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 469325733, now seen corresponding path program 1311 times [2020-01-16 18:42:50,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:50,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688744272] [2020-01-16 18:42:50,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:51,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688744272] [2020-01-16 18:42:51,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:51,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:51,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686498246] [2020-01-16 18:42:51,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:51,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:51,085 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:42:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:51,240 INFO L93 Difference]: Finished difference Result 1182 states and 4182 transitions. [2020-01-16 18:42:51,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:51,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:51,243 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:42:51,243 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:51,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:42:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:42:51,264 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:42:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:51,265 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:42:51,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:42:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:51,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:51,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:51,266 INFO L426 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1676845027, now seen corresponding path program 1312 times [2020-01-16 18:42:51,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:51,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085413827] [2020-01-16 18:42:51,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:51,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-01-16 18:42:51,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085413827] [2020-01-16 18:42:51,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:51,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:51,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57163865] [2020-01-16 18:42:51,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:51,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:51,614 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:42:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:51,773 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-01-16 18:42:51,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:51,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:51,776 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:42:51,776 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:51,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:42:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-01-16 18:42:51,797 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-01-16 18:42:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:51,797 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-01-16 18:42:51,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-01-16 18:42:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:51,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:51,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:51,798 INFO L426 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 490331941, now seen corresponding path program 1313 times [2020-01-16 18:42:51,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:51,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327043807] [2020-01-16 18:42:51,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:52,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327043807] [2020-01-16 18:42:52,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:52,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:52,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680211114] [2020-01-16 18:42:52,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:52,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:52,133 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:42:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:52,271 INFO L93 Difference]: Finished difference Result 1186 states and 4188 transitions. [2020-01-16 18:42:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:52,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:52,274 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:42:52,274 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:42:52,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:42:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:42:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-01-16 18:42:52,295 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-01-16 18:42:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:52,295 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-01-16 18:42:52,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-01-16 18:42:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:52,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:52,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:52,296 INFO L426 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash -582753439, now seen corresponding path program 1314 times [2020-01-16 18:42:52,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:52,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900290618] [2020-01-16 18:42:52,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:52,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-01-16 18:42:52,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900290618] [2020-01-16 18:42:52,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:52,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:52,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470999675] [2020-01-16 18:42:52,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:52,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:52,630 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:42:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:52,772 INFO L93 Difference]: Finished difference Result 1183 states and 4180 transitions. [2020-01-16 18:42:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:52,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:52,775 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:42:52,775 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:42:52,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:42:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-01-16 18:42:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:42:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3076 transitions. [2020-01-16 18:42:52,797 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3076 transitions. Word has length 25 [2020-01-16 18:42:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:52,797 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3076 transitions. [2020-01-16 18:42:52,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3076 transitions. [2020-01-16 18:42:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:52,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:52,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:52,798 INFO L426 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1311771327, now seen corresponding path program 1315 times [2020-01-16 18:42:52,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:52,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831526108] [2020-01-16 18:42:52,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:53,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831526108] [2020-01-16 18:42:53,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:53,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230362429] [2020-01-16 18:42:53,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:53,125 INFO L87 Difference]: Start difference. First operand 773 states and 3076 transitions. Second operand 10 states. [2020-01-16 18:42:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:53,260 INFO L93 Difference]: Finished difference Result 1202 states and 4227 transitions. [2020-01-16 18:42:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:53,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:53,264 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:42:53,264 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:42:53,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:42:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-01-16 18:42:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3092 transitions. [2020-01-16 18:42:53,285 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3092 transitions. Word has length 25 [2020-01-16 18:42:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:53,285 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3092 transitions. [2020-01-16 18:42:53,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3092 transitions. [2020-01-16 18:42:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:53,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:53,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:53,286 INFO L426 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1372255011, now seen corresponding path program 1316 times [2020-01-16 18:42:53,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:53,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999660872] [2020-01-16 18:42:53,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:53,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999660872] [2020-01-16 18:42:53,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:53,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:53,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676225341] [2020-01-16 18:42:53,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:53,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:53,614 INFO L87 Difference]: Start difference. First operand 780 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:42:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:53,789 INFO L93 Difference]: Finished difference Result 1200 states and 4218 transitions. [2020-01-16 18:42:53,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:53,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:53,793 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:42:53,793 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:42:53,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:42:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:42:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-01-16 18:42:53,813 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-01-16 18:42:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:53,813 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-01-16 18:42:53,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-01-16 18:42:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:53,814 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:53,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] [2020-01-16 18:42:53,815 INFO L426 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1889104381, now seen corresponding path program 1317 times [2020-01-16 18:42:53,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:53,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428304995] [2020-01-16 18:42:53,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:54,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428304995] [2020-01-16 18:42:54,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:54,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:54,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151655205] [2020-01-16 18:42:54,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:54,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:54,133 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:42:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:54,275 INFO L93 Difference]: Finished difference Result 1196 states and 4210 transitions. [2020-01-16 18:42:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:54,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:54,279 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:42:54,279 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:42:54,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:42:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:42:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-01-16 18:42:54,298 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-01-16 18:42:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:54,299 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-01-16 18:42:54,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-01-16 18:42:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:54,300 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:54,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:54,300 INFO L426 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1351248803, now seen corresponding path program 1318 times [2020-01-16 18:42:54,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:54,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726442232] [2020-01-16 18:42:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:54,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726442232] [2020-01-16 18:42:54,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:54,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:54,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109112910] [2020-01-16 18:42:54,618 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:54,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:54,618 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:42:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:54,759 INFO L93 Difference]: Finished difference Result 1191 states and 4198 transitions. [2020-01-16 18:42:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:54,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:54,762 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:42:54,762 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:54,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:42:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:42:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3079 transitions. [2020-01-16 18:42:54,783 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3079 transitions. Word has length 25 [2020-01-16 18:42:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:54,783 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3079 transitions. [2020-01-16 18:42:54,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3079 transitions. [2020-01-16 18:42:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:54,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:54,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:54,784 INFO L426 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601277, now seen corresponding path program 1319 times [2020-01-16 18:42:54,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:54,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424450665] [2020-01-16 18:42:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:55,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424450665] [2020-01-16 18:42:55,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:55,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120820897] [2020-01-16 18:42:55,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:55,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:55,112 INFO L87 Difference]: Start difference. First operand 775 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:42:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:55,253 INFO L93 Difference]: Finished difference Result 1192 states and 4200 transitions. [2020-01-16 18:42:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:55,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:55,256 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:42:55,256 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:42:55,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:42:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:42:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3082 transitions. [2020-01-16 18:42:55,276 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3082 transitions. Word has length 25 [2020-01-16 18:42:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:55,276 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3082 transitions. [2020-01-16 18:42:55,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3082 transitions. [2020-01-16 18:42:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:55,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:55,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:55,278 INFO L426 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1343280639, now seen corresponding path program 1320 times [2020-01-16 18:42:55,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:55,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459871559] [2020-01-16 18:42:55,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:55,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459871559] [2020-01-16 18:42:55,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:55,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:55,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883810234] [2020-01-16 18:42:55,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:55,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:55,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:55,605 INFO L87 Difference]: Start difference. First operand 777 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:42:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:55,751 INFO L93 Difference]: Finished difference Result 1189 states and 4192 transitions. [2020-01-16 18:42:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:55,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:55,754 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:42:55,754 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:42:55,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:42:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 769. [2020-01-16 18:42:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:42:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3068 transitions. [2020-01-16 18:42:55,774 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3068 transitions. Word has length 25 [2020-01-16 18:42:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:55,774 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3068 transitions. [2020-01-16 18:42:55,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3068 transitions. [2020-01-16 18:42:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:55,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:55,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:55,775 INFO L426 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -984451491, now seen corresponding path program 1321 times [2020-01-16 18:42:55,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:55,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548402838] [2020-01-16 18:42:55,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:56,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548402838] [2020-01-16 18:42:56,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:56,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:56,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896135456] [2020-01-16 18:42:56,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:56,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:56,125 INFO L87 Difference]: Start difference. First operand 769 states and 3068 transitions. Second operand 10 states. [2020-01-16 18:42:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:56,269 INFO L93 Difference]: Finished difference Result 1226 states and 4316 transitions. [2020-01-16 18:42:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:56,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:56,273 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:42:56,273 INFO L226 Difference]: Without dead ends: 1211 [2020-01-16 18:42:56,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2020-01-16 18:42:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 780. [2020-01-16 18:42:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-01-16 18:42:56,293 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-01-16 18:42:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:56,293 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-01-16 18:42:56,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-01-16 18:42:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:56,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:56,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:56,295 INFO L426 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 626489467, now seen corresponding path program 1322 times [2020-01-16 18:42:56,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:56,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611124716] [2020-01-16 18:42:56,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:56,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-01-16 18:42:56,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611124716] [2020-01-16 18:42:56,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:56,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:56,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144815732] [2020-01-16 18:42:56,637 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:56,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:56,637 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:42:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:56,773 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-01-16 18:42:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:56,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:56,777 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:42:56,777 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:42:56,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:42:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 777. [2020-01-16 18:42:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:42:56,797 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:42:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:56,797 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:42:56,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:42:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:56,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:56,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:56,798 INFO L426 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1710077951, now seen corresponding path program 1323 times [2020-01-16 18:42:56,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:56,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445382576] [2020-01-16 18:42:56,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:57,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445382576] [2020-01-16 18:42:57,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:57,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:57,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588284] [2020-01-16 18:42:57,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:57,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:57,157 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:42:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:57,326 INFO L93 Difference]: Finished difference Result 1233 states and 4330 transitions. [2020-01-16 18:42:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:57,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:57,329 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:42:57,329 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:42:57,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:42:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-01-16 18:42:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:42:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:42:57,350 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:42:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:57,350 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:42:57,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:42:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:57,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:57,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:57,351 INFO L426 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 636992571, now seen corresponding path program 1324 times [2020-01-16 18:42:57,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:57,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130406722] [2020-01-16 18:42:57,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:57,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130406722] [2020-01-16 18:42:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642706557] [2020-01-16 18:42:57,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:57,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:57,708 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:42:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:57,848 INFO L93 Difference]: Finished difference Result 1234 states and 4326 transitions. [2020-01-16 18:42:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:57,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:57,851 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:42:57,851 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:42:57,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:42:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 777. [2020-01-16 18:42:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:42:57,871 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:57,871 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:42:57,871 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:42:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:57,872 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:57,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:57,873 INFO L426 AbstractCegarLoop]: === Iteration 1332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1720581055, now seen corresponding path program 1325 times [2020-01-16 18:42:57,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:57,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703213738] [2020-01-16 18:42:57,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:58,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703213738] [2020-01-16 18:42:58,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:58,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:58,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229669709] [2020-01-16 18:42:58,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:58,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:58,227 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:42:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:58,358 INFO L93 Difference]: Finished difference Result 1224 states and 4306 transitions. [2020-01-16 18:42:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:58,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:58,362 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:42:58,362 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:42:58,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:42:58,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 780. [2020-01-16 18:42:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:42:58,382 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:42:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:58,382 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:42:58,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:42:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:58,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:58,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:58,383 INFO L426 AbstractCegarLoop]: === Iteration 1333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash -963445283, now seen corresponding path program 1326 times [2020-01-16 18:42:58,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:58,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742575553] [2020-01-16 18:42:58,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:58,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-01-16 18:42:58,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742575553] [2020-01-16 18:42:58,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:58,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709948278] [2020-01-16 18:42:58,734 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:58,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:58,735 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:42:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:58,858 INFO L93 Difference]: Finished difference Result 1228 states and 4311 transitions. [2020-01-16 18:42:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:58,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:58,861 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:42:58,861 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:42:58,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:42:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 774. [2020-01-16 18:42:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:42:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-01-16 18:42:58,881 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-01-16 18:42:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:58,881 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-01-16 18:42:58,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-01-16 18:42:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:58,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:58,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:58,882 INFO L426 AbstractCegarLoop]: === Iteration 1334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 941582587, now seen corresponding path program 1327 times [2020-01-16 18:42:58,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:58,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125800771] [2020-01-16 18:42:58,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:59,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125800771] [2020-01-16 18:42:59,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:59,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:59,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667433546] [2020-01-16 18:42:59,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:59,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:59,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:59,233 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:42:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:59,359 INFO L93 Difference]: Finished difference Result 1223 states and 4306 transitions. [2020-01-16 18:42:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:59,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:59,363 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:42:59,363 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:42:59,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:42:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-01-16 18:42:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:42:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-01-16 18:42:59,383 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-01-16 18:42:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:59,383 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-01-16 18:42:59,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-01-16 18:42:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:59,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:59,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:59,384 INFO L426 AbstractCegarLoop]: === Iteration 1335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1742443751, now seen corresponding path program 1328 times [2020-01-16 18:42:59,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:59,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435791005] [2020-01-16 18:42:59,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:42:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:42:59,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435791005] [2020-01-16 18:42:59,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:42:59,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:42:59,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381603390] [2020-01-16 18:42:59,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:42:59,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:42:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:42:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:42:59,732 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:42:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:42:59,852 INFO L93 Difference]: Finished difference Result 1220 states and 4297 transitions. [2020-01-16 18:42:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:42:59,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:42:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:42:59,856 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:42:59,856 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:42:59,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:42:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:42:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-01-16 18:42:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:42:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:42:59,877 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:42:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:42:59,877 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:42:59,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:42:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:42:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:42:59,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:42:59,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:42:59,878 INFO L426 AbstractCegarLoop]: === Iteration 1336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:42:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:42:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2035674175, now seen corresponding path program 1329 times [2020-01-16 18:42:59,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:42:59,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641635496] [2020-01-16 18:42:59,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:42:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:00,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641635496] [2020-01-16 18:43:00,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:00,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:00,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367562676] [2020-01-16 18:43:00,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:00,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:00,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:00,239 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:43:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:00,357 INFO L93 Difference]: Finished difference Result 1227 states and 4313 transitions. [2020-01-16 18:43:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:00,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:00,360 INFO L225 Difference]: With dead ends: 1227 [2020-01-16 18:43:00,360 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:43:00,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:43:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-01-16 18:43:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:43:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:43:00,380 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:43:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:00,380 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:43:00,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:43:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:00,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:00,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:00,381 INFO L426 AbstractCegarLoop]: === Iteration 1337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1721437543, now seen corresponding path program 1330 times [2020-01-16 18:43:00,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:00,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142273422] [2020-01-16 18:43:00,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142273422] [2020-01-16 18:43:00,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:00,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:00,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374137546] [2020-01-16 18:43:00,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:00,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:00,727 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:43:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:00,856 INFO L93 Difference]: Finished difference Result 1226 states and 4306 transitions. [2020-01-16 18:43:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:00,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:00,860 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:43:00,860 INFO L226 Difference]: Without dead ends: 1207 [2020-01-16 18:43:00,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-01-16 18:43:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 777. [2020-01-16 18:43:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:43:00,880 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:43:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:00,880 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:43:00,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:43:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:00,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:00,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:00,882 INFO L426 AbstractCegarLoop]: === Iteration 1338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2046177279, now seen corresponding path program 1331 times [2020-01-16 18:43:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:00,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801184744] [2020-01-16 18:43:00,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:01,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801184744] [2020-01-16 18:43:01,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:01,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:01,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217660124] [2020-01-16 18:43:01,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:01,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:01,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:01,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:01,226 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:43:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:01,354 INFO L93 Difference]: Finished difference Result 1219 states and 4292 transitions. [2020-01-16 18:43:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:01,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:01,358 INFO L225 Difference]: With dead ends: 1219 [2020-01-16 18:43:01,358 INFO L226 Difference]: Without dead ends: 1207 [2020-01-16 18:43:01,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-01-16 18:43:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 780. [2020-01-16 18:43:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:43:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:43:01,379 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:43:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:01,379 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:43:01,379 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:43:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:01,380 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:01,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:01,380 INFO L426 AbstractCegarLoop]: === Iteration 1339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 973091899, now seen corresponding path program 1332 times [2020-01-16 18:43:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:01,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639125056] [2020-01-16 18:43:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:01,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639125056] [2020-01-16 18:43:01,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:01,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:01,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424074656] [2020-01-16 18:43:01,725 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:01,725 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:43:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:01,852 INFO L93 Difference]: Finished difference Result 1221 states and 4293 transitions. [2020-01-16 18:43:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:01,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:01,855 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:43:01,855 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:43:01,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:43:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 774. [2020-01-16 18:43:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:43:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3087 transitions. [2020-01-16 18:43:01,876 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3087 transitions. Word has length 25 [2020-01-16 18:43:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:01,876 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3087 transitions. [2020-01-16 18:43:01,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3087 transitions. [2020-01-16 18:43:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:01,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:01,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] [2020-01-16 18:43:01,877 INFO L426 AbstractCegarLoop]: === Iteration 1340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1267178811, now seen corresponding path program 1333 times [2020-01-16 18:43:01,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:01,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979879856] [2020-01-16 18:43:01,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:02,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979879856] [2020-01-16 18:43:02,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:02,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:02,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75798461] [2020-01-16 18:43:02,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:02,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:02,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:02,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:02,231 INFO L87 Difference]: Start difference. First operand 774 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:43:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:02,348 INFO L93 Difference]: Finished difference Result 1241 states and 4351 transitions. [2020-01-16 18:43:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:02,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:02,352 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:43:02,352 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:43:02,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:43:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 785. [2020-01-16 18:43:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:43:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-01-16 18:43:02,373 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-01-16 18:43:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:02,373 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-01-16 18:43:02,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-01-16 18:43:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:02,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:02,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:02,374 INFO L426 AbstractCegarLoop]: === Iteration 1341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash 194093431, now seen corresponding path program 1334 times [2020-01-16 18:43:02,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:02,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448009766] [2020-01-16 18:43:02,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:02,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-01-16 18:43:02,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448009766] [2020-01-16 18:43:02,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:02,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:02,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259643516] [2020-01-16 18:43:02,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:02,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:02,726 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:43:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:02,864 INFO L93 Difference]: Finished difference Result 1242 states and 4347 transitions. [2020-01-16 18:43:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:02,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:02,868 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:43:02,868 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:43:02,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:43:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 779. [2020-01-16 18:43:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-01-16 18:43:02,888 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-01-16 18:43:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:02,888 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-01-16 18:43:02,888 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-01-16 18:43:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:02,889 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:02,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:02,889 INFO L426 AbstractCegarLoop]: === Iteration 1342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:02,890 INFO L82 PathProgramCache]: Analyzing trace with hash -333259043, now seen corresponding path program 1335 times [2020-01-16 18:43:02,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:02,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185191440] [2020-01-16 18:43:02,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:03,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-01-16 18:43:03,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185191440] [2020-01-16 18:43:03,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:03,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:03,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822188169] [2020-01-16 18:43:03,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:03,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:03,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:03,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:03,243 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:43:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:03,369 INFO L93 Difference]: Finished difference Result 1238 states and 4339 transitions. [2020-01-16 18:43:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:03,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:03,373 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:43:03,373 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:43:03,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:43:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 784. [2020-01-16 18:43:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:43:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-01-16 18:43:03,393 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-01-16 18:43:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:03,393 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-01-16 18:43:03,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-01-16 18:43:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:03,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:03,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:03,394 INFO L426 AbstractCegarLoop]: === Iteration 1343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash 204596535, now seen corresponding path program 1336 times [2020-01-16 18:43:03,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:03,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559209187] [2020-01-16 18:43:03,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:03,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559209187] [2020-01-16 18:43:03,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:03,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:03,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249878308] [2020-01-16 18:43:03,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:03,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:03,744 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:43:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:03,876 INFO L93 Difference]: Finished difference Result 1237 states and 4332 transitions. [2020-01-16 18:43:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:03,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:03,880 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:43:03,880 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:43:03,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:43:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 779. [2020-01-16 18:43:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:43:03,900 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:43:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:03,900 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:43:03,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:43:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:03,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:03,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:03,902 INFO L426 AbstractCegarLoop]: === Iteration 1344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash -312252835, now seen corresponding path program 1337 times [2020-01-16 18:43:03,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:03,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843677048] [2020-01-16 18:43:03,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:04,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843677048] [2020-01-16 18:43:04,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:04,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:04,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352915230] [2020-01-16 18:43:04,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:04,280 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:43:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:04,407 INFO L93 Difference]: Finished difference Result 1240 states and 4338 transitions. [2020-01-16 18:43:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:04,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:04,411 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:43:04,411 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:43:04,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:43:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 784. [2020-01-16 18:43:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:43:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3105 transitions. [2020-01-16 18:43:04,431 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3105 transitions. Word has length 25 [2020-01-16 18:43:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:04,431 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3105 transitions. [2020-01-16 18:43:04,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3105 transitions. [2020-01-16 18:43:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:04,432 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:04,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:04,433 INFO L426 AbstractCegarLoop]: === Iteration 1345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1298688123, now seen corresponding path program 1338 times [2020-01-16 18:43:04,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:04,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129356188] [2020-01-16 18:43:04,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:04,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-01-16 18:43:04,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129356188] [2020-01-16 18:43:04,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:04,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:04,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657022919] [2020-01-16 18:43:04,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:04,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:04,786 INFO L87 Difference]: Start difference. First operand 784 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:43:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:04,906 INFO L93 Difference]: Finished difference Result 1238 states and 4329 transitions. [2020-01-16 18:43:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:04,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:04,909 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:43:04,909 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:43:04,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:43:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 774. [2020-01-16 18:43:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:43:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3084 transitions. [2020-01-16 18:43:04,928 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3084 transitions. Word has length 25 [2020-01-16 18:43:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:04,928 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3084 transitions. [2020-01-16 18:43:04,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3084 transitions. [2020-01-16 18:43:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:04,930 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:04,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:04,930 INFO L426 AbstractCegarLoop]: === Iteration 1346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1091251303, now seen corresponding path program 1339 times [2020-01-16 18:43:04,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:04,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163724461] [2020-01-16 18:43:04,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:05,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163724461] [2020-01-16 18:43:05,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:05,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:05,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145105564] [2020-01-16 18:43:05,266 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:05,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:05,267 INFO L87 Difference]: Start difference. First operand 774 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:43:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:05,385 INFO L93 Difference]: Finished difference Result 1222 states and 4298 transitions. [2020-01-16 18:43:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:05,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:05,388 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:43:05,388 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:43:05,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:43:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-01-16 18:43:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:43:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:43:05,408 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:43:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:05,408 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:43:05,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:43:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:05,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:05,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:05,409 INFO L426 AbstractCegarLoop]: === Iteration 1347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 519689655, now seen corresponding path program 1340 times [2020-01-16 18:43:05,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:05,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472873623] [2020-01-16 18:43:05,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:05,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-01-16 18:43:05,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472873623] [2020-01-16 18:43:05,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:05,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:05,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300884716] [2020-01-16 18:43:05,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:05,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:05,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:05,755 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:43:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:05,880 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-01-16 18:43:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:05,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:05,884 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:43:05,884 INFO L226 Difference]: Without dead ends: 1207 [2020-01-16 18:43:05,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-01-16 18:43:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 777. [2020-01-16 18:43:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:43:05,904 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:43:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:05,904 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:43:05,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:43:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:05,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:05,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:05,906 INFO L426 AbstractCegarLoop]: === Iteration 1348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1603278139, now seen corresponding path program 1341 times [2020-01-16 18:43:05,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:05,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277475406] [2020-01-16 18:43:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:06,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277475406] [2020-01-16 18:43:06,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:06,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:06,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050972044] [2020-01-16 18:43:06,249 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:06,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:06,249 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:43:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:06,365 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-01-16 18:43:06,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:06,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:06,368 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:43:06,368 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:43:06,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:43:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-01-16 18:43:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:43:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3097 transitions. [2020-01-16 18:43:06,389 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3097 transitions. Word has length 25 [2020-01-16 18:43:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:06,389 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3097 transitions. [2020-01-16 18:43:06,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3097 transitions. [2020-01-16 18:43:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:06,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:06,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:06,390 INFO L426 AbstractCegarLoop]: === Iteration 1349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 530192759, now seen corresponding path program 1342 times [2020-01-16 18:43:06,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:06,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163932087] [2020-01-16 18:43:06,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:06,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163932087] [2020-01-16 18:43:06,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:06,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:06,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408832914] [2020-01-16 18:43:06,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:06,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:06,727 INFO L87 Difference]: Start difference. First operand 780 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:43:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:06,854 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-01-16 18:43:06,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:06,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:06,857 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:43:06,857 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:43:06,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:43:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-01-16 18:43:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3089 transitions. [2020-01-16 18:43:06,878 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3089 transitions. Word has length 25 [2020-01-16 18:43:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:06,878 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3089 transitions. [2020-01-16 18:43:06,878 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3089 transitions. [2020-01-16 18:43:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:06,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:06,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:06,879 INFO L426 AbstractCegarLoop]: === Iteration 1350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1613781243, now seen corresponding path program 1343 times [2020-01-16 18:43:06,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:06,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806840447] [2020-01-16 18:43:06,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:07,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806840447] [2020-01-16 18:43:07,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:07,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:07,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154733006] [2020-01-16 18:43:07,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:07,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:07,218 INFO L87 Difference]: Start difference. First operand 777 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:43:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:07,343 INFO L93 Difference]: Finished difference Result 1230 states and 4310 transitions. [2020-01-16 18:43:07,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:07,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:07,346 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:43:07,346 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:43:07,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:43:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 782. [2020-01-16 18:43:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:43:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3098 transitions. [2020-01-16 18:43:07,367 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3098 transitions. Word has length 25 [2020-01-16 18:43:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:07,367 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3098 transitions. [2020-01-16 18:43:07,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3098 transitions. [2020-01-16 18:43:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:07,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:07,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:07,368 INFO L426 AbstractCegarLoop]: === Iteration 1351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1070245095, now seen corresponding path program 1344 times [2020-01-16 18:43:07,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:07,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799472726] [2020-01-16 18:43:07,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:07,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799472726] [2020-01-16 18:43:07,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:07,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:07,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365220654] [2020-01-16 18:43:07,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:07,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:07,708 INFO L87 Difference]: Start difference. First operand 782 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:43:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:07,838 INFO L93 Difference]: Finished difference Result 1228 states and 4301 transitions. [2020-01-16 18:43:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:07,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:07,842 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:43:07,842 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:43:07,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:43:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 771. [2020-01-16 18:43:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:43:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:43:07,861 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:43:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:07,862 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:43:07,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:43:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:07,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:07,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:07,863 INFO L426 AbstractCegarLoop]: === Iteration 1352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1829422943, now seen corresponding path program 1345 times [2020-01-16 18:43:07,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:07,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917945087] [2020-01-16 18:43:07,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:08,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-01-16 18:43:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917945087] [2020-01-16 18:43:08,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:08,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:08,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789546092] [2020-01-16 18:43:08,212 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:08,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:08,212 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:43:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:08,331 INFO L93 Difference]: Finished difference Result 1210 states and 4262 transitions. [2020-01-16 18:43:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:08,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:08,334 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:43:08,335 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:43:08,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:43:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-01-16 18:43:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:43:08,355 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:43:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:08,355 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:43:08,355 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:43:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:08,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:08,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:08,357 INFO L426 AbstractCegarLoop]: === Iteration 1353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash -218481985, now seen corresponding path program 1346 times [2020-01-16 18:43:08,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:08,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332770509] [2020-01-16 18:43:08,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:08,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332770509] [2020-01-16 18:43:08,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:08,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:08,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404203127] [2020-01-16 18:43:08,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:08,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:08,713 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:43:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:08,844 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-01-16 18:43:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:08,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:08,847 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:43:08,847 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:43:08,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:43:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-01-16 18:43:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:43:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-01-16 18:43:08,868 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-01-16 18:43:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:08,868 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-01-16 18:43:08,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-01-16 18:43:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:08,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:08,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:08,869 INFO L426 AbstractCegarLoop]: === Iteration 1354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 865106499, now seen corresponding path program 1347 times [2020-01-16 18:43:08,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:08,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060289792] [2020-01-16 18:43:08,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:09,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060289792] [2020-01-16 18:43:09,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:09,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:09,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440360352] [2020-01-16 18:43:09,218 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:09,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:09,218 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:43:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:09,338 INFO L93 Difference]: Finished difference Result 1217 states and 4276 transitions. [2020-01-16 18:43:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:09,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:09,341 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:43:09,341 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:43:09,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:43:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-01-16 18:43:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:43:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3105 transitions. [2020-01-16 18:43:09,362 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3105 transitions. Word has length 25 [2020-01-16 18:43:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:09,362 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3105 transitions. [2020-01-16 18:43:09,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3105 transitions. [2020-01-16 18:43:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:09,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:09,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:09,363 INFO L426 AbstractCegarLoop]: === Iteration 1355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -207978881, now seen corresponding path program 1348 times [2020-01-16 18:43:09,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:09,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211214137] [2020-01-16 18:43:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:09,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211214137] [2020-01-16 18:43:09,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:09,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:09,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8526215] [2020-01-16 18:43:09,711 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:09,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:09,712 INFO L87 Difference]: Start difference. First operand 782 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:43:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:09,841 INFO L93 Difference]: Finished difference Result 1218 states and 4272 transitions. [2020-01-16 18:43:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:09,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:09,844 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:43:09,844 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:43:09,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:43:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 776. [2020-01-16 18:43:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:43:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-01-16 18:43:09,865 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-01-16 18:43:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:09,865 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-01-16 18:43:09,865 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-01-16 18:43:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:09,866 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:09,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:09,866 INFO L426 AbstractCegarLoop]: === Iteration 1356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash 875609603, now seen corresponding path program 1349 times [2020-01-16 18:43:09,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:09,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32123859] [2020-01-16 18:43:09,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:10,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32123859] [2020-01-16 18:43:10,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:10,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:10,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905066592] [2020-01-16 18:43:10,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:10,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:10,214 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:43:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:10,361 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-01-16 18:43:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:10,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:10,364 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:43:10,365 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:43:10,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:43:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-01-16 18:43:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:43:10,386 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:43:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:10,386 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:43:10,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:43:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:10,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:10,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:10,387 INFO L426 AbstractCegarLoop]: === Iteration 1357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1808416735, now seen corresponding path program 1350 times [2020-01-16 18:43:10,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:10,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604001810] [2020-01-16 18:43:10,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:10,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-01-16 18:43:10,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604001810] [2020-01-16 18:43:10,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:10,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:10,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730045541] [2020-01-16 18:43:10,735 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:10,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:10,735 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:43:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:10,859 INFO L93 Difference]: Finished difference Result 1212 states and 4257 transitions. [2020-01-16 18:43:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:10,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:10,863 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:43:10,863 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:43:10,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:43:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 773. [2020-01-16 18:43:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:43:10,882 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:43:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:10,883 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:43:10,883 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:43:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:10,884 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:10,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:10,884 INFO L426 AbstractCegarLoop]: === Iteration 1358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash -346288005, now seen corresponding path program 1351 times [2020-01-16 18:43:10,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:10,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481566178] [2020-01-16 18:43:10,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:11,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481566178] [2020-01-16 18:43:11,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:11,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:11,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590977640] [2020-01-16 18:43:11,232 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:11,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:11,233 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:43:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:11,368 INFO L93 Difference]: Finished difference Result 1199 states and 4231 transitions. [2020-01-16 18:43:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:11,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:11,372 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:43:11,372 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:43:11,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:43:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 778. [2020-01-16 18:43:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:43:11,393 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:43:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:11,393 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:43:11,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:43:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:11,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:11,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:11,394 INFO L426 AbstractCegarLoop]: === Iteration 1359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1264652953, now seen corresponding path program 1352 times [2020-01-16 18:43:11,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:11,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598460456] [2020-01-16 18:43:11,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:11,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598460456] [2020-01-16 18:43:11,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:11,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:11,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419738062] [2020-01-16 18:43:11,760 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:11,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:11,761 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:43:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:11,888 INFO L93 Difference]: Finished difference Result 1196 states and 4222 transitions. [2020-01-16 18:43:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:11,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:11,891 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:43:11,891 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:43:11,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:43:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:43:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:43:11,912 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:43:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:11,912 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:43:11,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:43:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:11,913 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:11,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:11,913 INFO L426 AbstractCegarLoop]: === Iteration 1360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1841895171, now seen corresponding path program 1353 times [2020-01-16 18:43:11,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:11,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619653862] [2020-01-16 18:43:11,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:12,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619653862] [2020-01-16 18:43:12,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:12,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:12,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52414487] [2020-01-16 18:43:12,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:12,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:12,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:12,253 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:43:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:12,409 INFO L93 Difference]: Finished difference Result 1197 states and 4224 transitions. [2020-01-16 18:43:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:12,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:12,413 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:43:12,413 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:43:12,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:43:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:43:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:43:12,433 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:43:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:12,433 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:43:12,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:43:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:12,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:12,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:12,435 INFO L426 AbstractCegarLoop]: === Iteration 1361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1306665369, now seen corresponding path program 1354 times [2020-01-16 18:43:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099685873] [2020-01-16 18:43:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099685873] [2020-01-16 18:43:12,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:12,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497114739] [2020-01-16 18:43:12,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:12,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:12,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:12,771 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:43:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:12,907 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:43:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:12,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:12,910 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:43:12,910 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:43:12,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:43:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-01-16 18:43:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:43:12,930 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:43:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:12,931 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:43:12,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:43:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:12,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:12,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:12,932 INFO L426 AbstractCegarLoop]: === Iteration 1362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1852398275, now seen corresponding path program 1355 times [2020-01-16 18:43:12,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:12,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852848304] [2020-01-16 18:43:12,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:13,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852848304] [2020-01-16 18:43:13,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:13,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:13,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994704847] [2020-01-16 18:43:13,278 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:13,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:13,279 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:43:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:13,413 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-01-16 18:43:13,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:13,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:13,417 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:43:13,417 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:43:13,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:43:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-01-16 18:43:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:43:13,438 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:43:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:13,438 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:43:13,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:43:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:13,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:13,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:13,439 INFO L426 AbstractCegarLoop]: === Iteration 1363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash -293772485, now seen corresponding path program 1356 times [2020-01-16 18:43:13,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:13,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516661252] [2020-01-16 18:43:13,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:13,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516661252] [2020-01-16 18:43:13,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:13,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:13,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889425667] [2020-01-16 18:43:13,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:13,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:13,789 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:43:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:13,939 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-01-16 18:43:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:13,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:13,943 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:43:13,943 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:43:13,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:43:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-01-16 18:43:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:43:13,963 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:43:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:13,963 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:43:13,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:43:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:13,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:13,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:13,964 INFO L426 AbstractCegarLoop]: === Iteration 1364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash -20691781, now seen corresponding path program 1357 times [2020-01-16 18:43:13,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:13,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770640587] [2020-01-16 18:43:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770640587] [2020-01-16 18:43:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:14,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:14,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152084344] [2020-01-16 18:43:14,302 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:14,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:14,302 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:43:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:14,450 INFO L93 Difference]: Finished difference Result 1213 states and 4263 transitions. [2020-01-16 18:43:14,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:14,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:14,453 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:43:14,453 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:43:14,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:43:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-01-16 18:43:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:43:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-01-16 18:43:14,474 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-01-16 18:43:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:14,474 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-01-16 18:43:14,474 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-01-16 18:43:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:14,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:14,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:14,475 INFO L426 AbstractCegarLoop]: === Iteration 1365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1093777161, now seen corresponding path program 1358 times [2020-01-16 18:43:14,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:14,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630982687] [2020-01-16 18:43:14,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:14,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630982687] [2020-01-16 18:43:14,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:14,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:14,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621291788] [2020-01-16 18:43:14,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:14,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:14,828 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:43:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:14,963 INFO L93 Difference]: Finished difference Result 1214 states and 4259 transitions. [2020-01-16 18:43:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:14,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:14,966 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:43:14,966 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:43:14,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:43:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:43:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:43:14,985 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:43:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:14,985 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:43:14,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:43:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:14,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:14,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:14,987 INFO L426 AbstractCegarLoop]: === Iteration 1366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -527038047, now seen corresponding path program 1359 times [2020-01-16 18:43:14,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:14,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14411120] [2020-01-16 18:43:14,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:15,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14411120] [2020-01-16 18:43:15,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:15,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:15,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618568747] [2020-01-16 18:43:15,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:15,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:15,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:15,323 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:43:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:15,445 INFO L93 Difference]: Finished difference Result 1204 states and 4239 transitions. [2020-01-16 18:43:15,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:15,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:15,448 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:43:15,448 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:43:15,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:43:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-01-16 18:43:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:43:15,468 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:43:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:15,468 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:43:15,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:43:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:15,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:15,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:15,469 INFO L426 AbstractCegarLoop]: === Iteration 1367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1062267849, now seen corresponding path program 1360 times [2020-01-16 18:43:15,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:15,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407508958] [2020-01-16 18:43:15,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:15,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407508958] [2020-01-16 18:43:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:15,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:15,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622569816] [2020-01-16 18:43:15,804 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:15,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:15,804 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:43:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:15,950 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:43:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:15,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:15,953 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:43:15,953 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:43:15,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:43:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-01-16 18:43:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:43:15,974 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:43:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:15,974 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:43:15,974 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:43:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:15,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:15,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:15,975 INFO L426 AbstractCegarLoop]: === Iteration 1368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -506031839, now seen corresponding path program 1361 times [2020-01-16 18:43:15,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:15,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036767969] [2020-01-16 18:43:15,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:16,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036767969] [2020-01-16 18:43:16,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:16,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:16,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330082146] [2020-01-16 18:43:16,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:16,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:16,315 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:43:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:16,450 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-01-16 18:43:16,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:16,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:16,453 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:43:16,453 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:43:16,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:43:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:43:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:43:16,472 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:43:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:16,472 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:43:16,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:43:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:16,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:16,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:16,473 INFO L426 AbstractCegarLoop]: === Iteration 1369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash 31823739, now seen corresponding path program 1362 times [2020-01-16 18:43:16,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:16,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917343089] [2020-01-16 18:43:16,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:16,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917343089] [2020-01-16 18:43:16,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:16,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:16,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80620010] [2020-01-16 18:43:16,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:16,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:16,827 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:43:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:16,957 INFO L93 Difference]: Finished difference Result 1201 states and 4229 transitions. [2020-01-16 18:43:16,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:16,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:16,960 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:43:16,960 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:43:16,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:43:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-01-16 18:43:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:43:16,980 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:43:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:16,980 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:43:16,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:43:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:16,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:16,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:16,981 INFO L426 AbstractCegarLoop]: === Iteration 1370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1915845401, now seen corresponding path program 1363 times [2020-01-16 18:43:16,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:16,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946565075] [2020-01-16 18:43:16,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:17,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946565075] [2020-01-16 18:43:17,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:17,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:17,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465322209] [2020-01-16 18:43:17,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:17,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:17,331 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:43:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:17,471 INFO L93 Difference]: Finished difference Result 1198 states and 4225 transitions. [2020-01-16 18:43:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:17,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:17,474 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:43:17,474 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:43:17,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:43:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 778. [2020-01-16 18:43:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-01-16 18:43:17,495 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-01-16 18:43:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:17,495 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-01-16 18:43:17,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-01-16 18:43:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:17,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:17,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:17,496 INFO L426 AbstractCegarLoop]: === Iteration 1371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash -768180937, now seen corresponding path program 1364 times [2020-01-16 18:43:17,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:17,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112505705] [2020-01-16 18:43:17,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:17,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112505705] [2020-01-16 18:43:17,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:17,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:17,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909512012] [2020-01-16 18:43:17,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:17,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:17,853 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:43:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:17,999 INFO L93 Difference]: Finished difference Result 1202 states and 4230 transitions. [2020-01-16 18:43:18,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:18,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:18,003 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:43:18,003 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:43:18,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:43:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-01-16 18:43:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:43:18,023 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:43:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:18,023 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:43:18,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:43:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:18,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:18,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:18,024 INFO L426 AbstractCegarLoop]: === Iteration 1372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1409499135, now seen corresponding path program 1365 times [2020-01-16 18:43:18,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:18,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781187515] [2020-01-16 18:43:18,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:18,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781187515] [2020-01-16 18:43:18,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:18,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:18,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123448624] [2020-01-16 18:43:18,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:18,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:18,377 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:43:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:18,511 INFO L93 Difference]: Finished difference Result 1192 states and 4210 transitions. [2020-01-16 18:43:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:18,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:18,514 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:43:18,515 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:43:18,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:43:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:43:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:43:18,536 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:43:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:18,536 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:43:18,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:43:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:18,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:18,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:18,537 INFO L426 AbstractCegarLoop]: === Iteration 1373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash -736671625, now seen corresponding path program 1366 times [2020-01-16 18:43:18,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:18,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710567302] [2020-01-16 18:43:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:18,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710567302] [2020-01-16 18:43:18,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:18,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:18,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521870600] [2020-01-16 18:43:18,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:18,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:18,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:18,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:18,891 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:43:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:19,037 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-01-16 18:43:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:19,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:19,040 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:43:19,040 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:43:19,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:43:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:43:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:43:19,061 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:43:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:19,062 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:43:19,062 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:43:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:19,063 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:19,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:19,063 INFO L426 AbstractCegarLoop]: === Iteration 1374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1420002239, now seen corresponding path program 1367 times [2020-01-16 18:43:19,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:19,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144544450] [2020-01-16 18:43:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:19,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-01-16 18:43:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144544450] [2020-01-16 18:43:19,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:19,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:19,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735209269] [2020-01-16 18:43:19,408 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:19,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:19,408 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:43:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:19,545 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-01-16 18:43:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:19,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:19,548 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:43:19,548 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:43:19,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:43:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-01-16 18:43:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:43:19,568 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:43:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:19,568 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:43:19,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:43:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:19,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:19,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:19,569 INFO L426 AbstractCegarLoop]: === Iteration 1375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1957857817, now seen corresponding path program 1368 times [2020-01-16 18:43:19,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:19,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601912787] [2020-01-16 18:43:19,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:19,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-01-16 18:43:19,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601912787] [2020-01-16 18:43:19,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:19,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:19,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450207784] [2020-01-16 18:43:19,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:19,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:19,918 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:43:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:20,076 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-01-16 18:43:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:20,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:20,079 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:43:20,079 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:43:20,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:43:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 771. [2020-01-16 18:43:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:43:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-01-16 18:43:20,099 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-01-16 18:43:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:20,099 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-01-16 18:43:20,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-01-16 18:43:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:20,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:20,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:20,100 INFO L426 AbstractCegarLoop]: === Iteration 1376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash -325874591, now seen corresponding path program 1369 times [2020-01-16 18:43:20,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:20,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11781355] [2020-01-16 18:43:20,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:20,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11781355] [2020-01-16 18:43:20,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:20,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:20,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560350205] [2020-01-16 18:43:20,462 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:20,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:20,463 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-01-16 18:43:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:20,606 INFO L93 Difference]: Finished difference Result 1204 states and 4246 transitions. [2020-01-16 18:43:20,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:20,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:20,609 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:43:20,609 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:43:20,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:43:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 779. [2020-01-16 18:43:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:43:20,631 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:43:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:20,631 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:43:20,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:43:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:20,632 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:20,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:20,632 INFO L426 AbstractCegarLoop]: === Iteration 1377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1285066367, now seen corresponding path program 1370 times [2020-01-16 18:43:20,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:20,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089352888] [2020-01-16 18:43:20,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:20,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089352888] [2020-01-16 18:43:20,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:20,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:20,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654132750] [2020-01-16 18:43:20,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:20,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:20,997 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:43:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:21,150 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-01-16 18:43:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:21,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:21,153 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:43:21,153 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:43:21,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:43:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 776. [2020-01-16 18:43:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:43:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3092 transitions. [2020-01-16 18:43:21,173 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3092 transitions. Word has length 25 [2020-01-16 18:43:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:21,173 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3092 transitions. [2020-01-16 18:43:21,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3092 transitions. [2020-01-16 18:43:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:21,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:21,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:21,174 INFO L426 AbstractCegarLoop]: === Iteration 1378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:21,175 INFO L82 PathProgramCache]: Analyzing trace with hash 768216997, now seen corresponding path program 1371 times [2020-01-16 18:43:21,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:21,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056291586] [2020-01-16 18:43:21,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:21,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056291586] [2020-01-16 18:43:21,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:21,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:21,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272898995] [2020-01-16 18:43:21,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:21,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:21,522 INFO L87 Difference]: Start difference. First operand 776 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:43:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:21,679 INFO L93 Difference]: Finished difference Result 1208 states and 4253 transitions. [2020-01-16 18:43:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:21,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:21,682 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:43:21,682 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:43:21,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:43:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 781. [2020-01-16 18:43:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:43:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-01-16 18:43:21,702 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-01-16 18:43:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:21,702 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-01-16 18:43:21,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-01-16 18:43:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:21,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:21,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:21,704 INFO L426 AbstractCegarLoop]: === Iteration 1379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:21,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1306072575, now seen corresponding path program 1372 times [2020-01-16 18:43:21,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:21,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338647009] [2020-01-16 18:43:21,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:22,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338647009] [2020-01-16 18:43:22,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:22,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:22,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803670553] [2020-01-16 18:43:22,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:22,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:22,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:22,056 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:43:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:22,196 INFO L93 Difference]: Finished difference Result 1207 states and 4246 transitions. [2020-01-16 18:43:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:22,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:22,199 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:43:22,199 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:43:22,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:43:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-01-16 18:43:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:43:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3089 transitions. [2020-01-16 18:43:22,218 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3089 transitions. Word has length 25 [2020-01-16 18:43:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:22,219 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3089 transitions. [2020-01-16 18:43:22,219 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3089 transitions. [2020-01-16 18:43:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:22,220 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:22,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:22,220 INFO L426 AbstractCegarLoop]: === Iteration 1380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash 778720101, now seen corresponding path program 1373 times [2020-01-16 18:43:22,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:22,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729704374] [2020-01-16 18:43:22,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:22,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729704374] [2020-01-16 18:43:22,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:22,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:22,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482425074] [2020-01-16 18:43:22,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:22,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:22,567 INFO L87 Difference]: Start difference. First operand 776 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:43:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:22,717 INFO L93 Difference]: Finished difference Result 1200 states and 4232 transitions. [2020-01-16 18:43:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:22,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:22,720 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:43:22,720 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:43:22,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:43:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-01-16 18:43:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:43:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-01-16 18:43:22,740 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-01-16 18:43:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:22,740 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-01-16 18:43:22,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-01-16 18:43:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:22,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:22,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:22,741 INFO L426 AbstractCegarLoop]: === Iteration 1381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash -294365279, now seen corresponding path program 1374 times [2020-01-16 18:43:22,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:22,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708882656] [2020-01-16 18:43:22,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:23,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708882656] [2020-01-16 18:43:23,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:23,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:23,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978004509] [2020-01-16 18:43:23,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:23,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:23,085 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:43:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:23,237 INFO L93 Difference]: Finished difference Result 1202 states and 4233 transitions. [2020-01-16 18:43:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:23,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:23,240 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:43:23,241 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:43:23,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:43:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:43:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:43:23,261 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:43:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:23,261 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:43:23,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:43:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:23,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:23,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:23,262 INFO L426 AbstractCegarLoop]: === Iteration 1382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash -768773731, now seen corresponding path program 1375 times [2020-01-16 18:43:23,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:23,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593202859] [2020-01-16 18:43:23,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:23,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593202859] [2020-01-16 18:43:23,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:23,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:23,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820874833] [2020-01-16 18:43:23,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:23,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:23,607 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:43:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:23,737 INFO L93 Difference]: Finished difference Result 1196 states and 4222 transitions. [2020-01-16 18:43:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:23,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:23,740 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:43:23,741 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:43:23,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:43:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2020-01-16 18:43:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:43:23,761 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:43:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:23,761 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:43:23,761 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:43:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:23,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:23,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:23,762 INFO L426 AbstractCegarLoop]: === Iteration 1383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:23,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash 842167227, now seen corresponding path program 1376 times [2020-01-16 18:43:23,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:23,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663553912] [2020-01-16 18:43:23,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:24,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663553912] [2020-01-16 18:43:24,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:24,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:24,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903611518] [2020-01-16 18:43:24,127 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:24,127 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:43:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:24,259 INFO L93 Difference]: Finished difference Result 1193 states and 4213 transitions. [2020-01-16 18:43:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:24,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:24,262 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:43:24,262 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:43:24,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:43:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:43:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:43:24,282 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:43:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:24,282 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:43:24,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:43:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:24,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:24,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:24,284 INFO L426 AbstractCegarLoop]: === Iteration 1384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1419409445, now seen corresponding path program 1377 times [2020-01-16 18:43:24,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:24,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282806871] [2020-01-16 18:43:24,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:24,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282806871] [2020-01-16 18:43:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562452555] [2020-01-16 18:43:24,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:24,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:24,622 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:43:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:24,743 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-01-16 18:43:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:24,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:24,745 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:43:24,746 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:43:24,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:43:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-01-16 18:43:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:43:24,766 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:43:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:24,766 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:43:24,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:43:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:24,767 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:24,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:24,767 INFO L426 AbstractCegarLoop]: === Iteration 1385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash 884179643, now seen corresponding path program 1378 times [2020-01-16 18:43:24,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831412475] [2020-01-16 18:43:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:25,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831412475] [2020-01-16 18:43:25,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:25,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:25,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395037038] [2020-01-16 18:43:25,108 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:25,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:25,109 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:43:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:25,250 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-01-16 18:43:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:25,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:25,254 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:43:25,254 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:43:25,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:43:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:43:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:43:25,275 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:43:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:25,275 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:43:25,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:43:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:25,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43: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] [2020-01-16 18:43:25,276 INFO L426 AbstractCegarLoop]: === Iteration 1386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1429912549, now seen corresponding path program 1379 times [2020-01-16 18:43:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:25,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473625832] [2020-01-16 18:43:25,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:25,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473625832] [2020-01-16 18:43:25,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:25,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:25,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305023827] [2020-01-16 18:43:25,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:25,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:25,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:25,629 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:43:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:25,765 INFO L93 Difference]: Finished difference Result 1188 states and 4201 transitions. [2020-01-16 18:43:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:25,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:25,769 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:43:25,769 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:43:25,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:43:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:43:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:43:25,788 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:43:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:25,788 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:43:25,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:43:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:25,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:25,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:25,789 INFO L426 AbstractCegarLoop]: === Iteration 1387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash -716258211, now seen corresponding path program 1380 times [2020-01-16 18:43:25,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:25,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489128567] [2020-01-16 18:43:25,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:26,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-01-16 18:43:26,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489128567] [2020-01-16 18:43:26,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:26,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:26,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954984453] [2020-01-16 18:43:26,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:26,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:26,144 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:43:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:26,288 INFO L93 Difference]: Finished difference Result 1187 states and 4197 transitions. [2020-01-16 18:43:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:26,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:26,291 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:43:26,291 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:43:26,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:43:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:43:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:43:26,311 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:43:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:26,311 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:43:26,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:43:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:26,312 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:26,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:26,313 INFO L426 AbstractCegarLoop]: === Iteration 1388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -117581283, now seen corresponding path program 1381 times [2020-01-16 18:43:26,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:26,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545747088] [2020-01-16 18:43:26,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:26,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-01-16 18:43:26,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545747088] [2020-01-16 18:43:26,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:26,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:26,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106002681] [2020-01-16 18:43:26,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:26,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:26,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:26,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:26,661 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:43:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:26,809 INFO L93 Difference]: Finished difference Result 1204 states and 4240 transitions. [2020-01-16 18:43:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:26,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:26,813 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:43:26,813 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:43:26,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:43:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-01-16 18:43:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:43:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-01-16 18:43:26,834 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-01-16 18:43:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:26,834 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-01-16 18:43:26,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-01-16 18:43:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:26,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:26,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:26,836 INFO L426 AbstractCegarLoop]: === Iteration 1389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash 420274295, now seen corresponding path program 1382 times [2020-01-16 18:43:26,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:26,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937999] [2020-01-16 18:43:26,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:27,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937999] [2020-01-16 18:43:27,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:27,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:27,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967918496] [2020-01-16 18:43:27,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:27,197 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:43:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:27,347 INFO L93 Difference]: Finished difference Result 1203 states and 4233 transitions. [2020-01-16 18:43:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:27,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:27,350 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:43:27,350 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:43:27,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:43:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-01-16 18:43:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:43:27,371 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:43:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:27,371 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:43:27,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:43:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:27,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:27,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:27,372 INFO L426 AbstractCegarLoop]: === Iteration 1390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 976510305, now seen corresponding path program 1383 times [2020-01-16 18:43:27,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:27,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261935103] [2020-01-16 18:43:27,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:27,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261935103] [2020-01-16 18:43:27,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:27,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:27,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732367953] [2020-01-16 18:43:27,710 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:27,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:27,710 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:43:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:27,852 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-01-16 18:43:27,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:27,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:27,855 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:43:27,856 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:43:27,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:43:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-01-16 18:43:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:43:27,877 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:43:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:27,877 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:43:27,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:43:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:27,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:27,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:27,878 INFO L426 AbstractCegarLoop]: === Iteration 1391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 441280503, now seen corresponding path program 1384 times [2020-01-16 18:43:27,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:27,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798835895] [2020-01-16 18:43:27,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:28,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798835895] [2020-01-16 18:43:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:28,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680303431] [2020-01-16 18:43:28,219 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:28,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:28,220 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:43:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:28,362 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-01-16 18:43:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:28,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:28,365 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:43:28,365 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:43:28,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:43:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:43:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:43:28,386 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:43:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:28,386 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:43:28,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:43:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:28,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:28,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:28,387 INFO L426 AbstractCegarLoop]: === Iteration 1392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1008019617, now seen corresponding path program 1385 times [2020-01-16 18:43:28,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:28,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128754456] [2020-01-16 18:43:28,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:28,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128754456] [2020-01-16 18:43:28,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:28,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:28,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574619956] [2020-01-16 18:43:28,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:28,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:28,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:28,731 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:43:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:28,866 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-01-16 18:43:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:28,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:28,869 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:43:28,870 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:43:28,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:43:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:43:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:43:28,890 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:43:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:28,890 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:43:28,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:43:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:28,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:28,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:28,892 INFO L426 AbstractCegarLoop]: === Iteration 1393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash -65065763, now seen corresponding path program 1386 times [2020-01-16 18:43:28,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:28,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209978042] [2020-01-16 18:43:28,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:29,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209978042] [2020-01-16 18:43:29,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:29,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:29,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245040491] [2020-01-16 18:43:29,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:29,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:29,241 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:43:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:29,379 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-01-16 18:43:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:29,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:29,382 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:43:29,382 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:43:29,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:43:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-01-16 18:43:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-01-16 18:43:29,403 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-01-16 18:43:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:29,403 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-01-16 18:43:29,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-01-16 18:43:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:29,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:29,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:29,404 INFO L426 AbstractCegarLoop]: === Iteration 1394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1818955899, now seen corresponding path program 1387 times [2020-01-16 18:43:29,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:29,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965274587] [2020-01-16 18:43:29,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:29,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965274587] [2020-01-16 18:43:29,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:29,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:29,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671217205] [2020-01-16 18:43:29,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:29,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:29,753 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-01-16 18:43:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:29,881 INFO L93 Difference]: Finished difference Result 1191 states and 4208 transitions. [2020-01-16 18:43:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:29,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:29,885 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:43:29,885 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:43:29,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:43:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 778. [2020-01-16 18:43:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-01-16 18:43:29,905 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-01-16 18:43:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:29,905 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-01-16 18:43:29,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-01-16 18:43:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:29,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:29,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:29,906 INFO L426 AbstractCegarLoop]: === Iteration 1395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:29,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash 745870519, now seen corresponding path program 1388 times [2020-01-16 18:43:29,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:29,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358087031] [2020-01-16 18:43:29,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:30,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358087031] [2020-01-16 18:43:30,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:30,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:30,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288039700] [2020-01-16 18:43:30,267 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:30,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:30,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:30,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:30,267 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:43:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:30,408 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-01-16 18:43:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:30,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:30,411 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:43:30,411 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:43:30,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:43:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:43:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:43:30,430 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:43:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:30,430 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:43:30,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:43:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:30,431 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:30,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:30,431 INFO L426 AbstractCegarLoop]: === Iteration 1396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1381919809, now seen corresponding path program 1389 times [2020-01-16 18:43:30,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:30,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764501962] [2020-01-16 18:43:30,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:30,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764501962] [2020-01-16 18:43:30,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:30,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:30,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575292286] [2020-01-16 18:43:30,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:30,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:30,788 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:43:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:30,937 INFO L93 Difference]: Finished difference Result 1187 states and 4197 transitions. [2020-01-16 18:43:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:30,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:30,940 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:43:30,941 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:43:30,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:43:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:43:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:43:30,962 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:43:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:30,962 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:43:30,962 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:43:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:30,963 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:30,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:30,963 INFO L426 AbstractCegarLoop]: === Iteration 1397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 766876727, now seen corresponding path program 1390 times [2020-01-16 18:43:30,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:30,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426690712] [2020-01-16 18:43:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:31,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426690712] [2020-01-16 18:43:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:31,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045861611] [2020-01-16 18:43:31,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:31,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:31,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:31,320 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:43:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:31,463 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-01-16 18:43:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:31,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:31,466 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:43:31,466 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:43:31,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:43:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:43:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:43:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-01-16 18:43:31,486 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-01-16 18:43:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:31,486 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-01-16 18:43:31,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-01-16 18:43:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:31,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:31,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:31,487 INFO L426 AbstractCegarLoop]: === Iteration 1398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:31,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1360913601, now seen corresponding path program 1391 times [2020-01-16 18:43:31,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:31,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109794406] [2020-01-16 18:43:31,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:31,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109794406] [2020-01-16 18:43:31,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:31,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:31,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798313704] [2020-01-16 18:43:31,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:31,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:31,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:31,833 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:43:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:31,970 INFO L93 Difference]: Finished difference Result 1191 states and 4203 transitions. [2020-01-16 18:43:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:31,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:31,973 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:43:31,973 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:43:31,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:43:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-01-16 18:43:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:43:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-01-16 18:43:31,993 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-01-16 18:43:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:31,993 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-01-16 18:43:31,993 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-01-16 18:43:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:31,994 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:31,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] [2020-01-16 18:43:31,994 INFO L426 AbstractCegarLoop]: === Iteration 1399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1860968315, now seen corresponding path program 1392 times [2020-01-16 18:43:31,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:31,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238550459] [2020-01-16 18:43:31,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:32,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238550459] [2020-01-16 18:43:32,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:32,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:32,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264497808] [2020-01-16 18:43:32,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:32,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:32,338 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:43:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:32,471 INFO L93 Difference]: Finished difference Result 1188 states and 4195 transitions. [2020-01-16 18:43:32,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:32,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:32,474 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:43:32,474 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:43:32,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:43:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 771. [2020-01-16 18:43:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:43:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-01-16 18:43:32,494 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-01-16 18:43:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:32,494 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-01-16 18:43:32,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-01-16 18:43:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:32,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:32,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:32,495 INFO L426 AbstractCegarLoop]: === Iteration 1400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:32,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash -422764093, now seen corresponding path program 1393 times [2020-01-16 18:43:32,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:32,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160443326] [2020-01-16 18:43:32,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:32,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160443326] [2020-01-16 18:43:32,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:32,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:32,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075697600] [2020-01-16 18:43:32,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:32,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:32,855 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-01-16 18:43:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:33,006 INFO L93 Difference]: Finished difference Result 1233 states and 4323 transitions. [2020-01-16 18:43:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:33,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:33,009 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:43:33,009 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:43:33,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:43:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 784. [2020-01-16 18:43:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:43:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3112 transitions. [2020-01-16 18:43:33,030 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3112 transitions. Word has length 25 [2020-01-16 18:43:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:33,030 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3112 transitions. [2020-01-16 18:43:33,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3112 transitions. [2020-01-16 18:43:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:33,031 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:33,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:33,031 INFO L426 AbstractCegarLoop]: === Iteration 1401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1495849473, now seen corresponding path program 1394 times [2020-01-16 18:43:33,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:33,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4627675] [2020-01-16 18:43:33,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:33,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4627675] [2020-01-16 18:43:33,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:33,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:33,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460212830] [2020-01-16 18:43:33,399 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:33,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:33,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:33,400 INFO L87 Difference]: Start difference. First operand 784 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:43:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:33,520 INFO L93 Difference]: Finished difference Result 1234 states and 4319 transitions. [2020-01-16 18:43:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:33,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:33,524 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:43:33,524 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:43:33,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:43:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 778. [2020-01-16 18:43:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:43:33,545 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:43:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:33,545 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:43:33,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:43:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:33,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:33,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:33,546 INFO L426 AbstractCegarLoop]: === Iteration 1402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2023201947, now seen corresponding path program 1395 times [2020-01-16 18:43:33,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:33,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987196546] [2020-01-16 18:43:33,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:33,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987196546] [2020-01-16 18:43:33,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:33,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:33,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657376941] [2020-01-16 18:43:33,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:33,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:33,897 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:43:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:34,026 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-01-16 18:43:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:34,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:34,029 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:43:34,029 INFO L226 Difference]: Without dead ends: 1215 [2020-01-16 18:43:34,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-01-16 18:43:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 783. [2020-01-16 18:43:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:43:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-01-16 18:43:34,049 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-01-16 18:43:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:34,049 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-01-16 18:43:34,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-01-16 18:43:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:34,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:34,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] [2020-01-16 18:43:34,050 INFO L426 AbstractCegarLoop]: === Iteration 1403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1485346369, now seen corresponding path program 1396 times [2020-01-16 18:43:34,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:34,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155099273] [2020-01-16 18:43:34,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:34,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155099273] [2020-01-16 18:43:34,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:34,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:34,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186954533] [2020-01-16 18:43:34,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:34,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:34,404 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:43:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:34,576 INFO L93 Difference]: Finished difference Result 1229 states and 4304 transitions. [2020-01-16 18:43:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:34,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:34,580 INFO L225 Difference]: With dead ends: 1229 [2020-01-16 18:43:34,580 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:43:34,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:43:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 778. [2020-01-16 18:43:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:43:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3091 transitions. [2020-01-16 18:43:34,600 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3091 transitions. Word has length 25 [2020-01-16 18:43:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:34,600 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3091 transitions. [2020-01-16 18:43:34,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3091 transitions. [2020-01-16 18:43:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:34,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:34,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:34,602 INFO L426 AbstractCegarLoop]: === Iteration 1404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2002195739, now seen corresponding path program 1397 times [2020-01-16 18:43:34,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:34,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090299463] [2020-01-16 18:43:34,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:34,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090299463] [2020-01-16 18:43:34,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:34,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:34,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584691958] [2020-01-16 18:43:34,953 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:34,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:34,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:34,953 INFO L87 Difference]: Start difference. First operand 778 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:43:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:35,122 INFO L93 Difference]: Finished difference Result 1232 states and 4310 transitions. [2020-01-16 18:43:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:35,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:35,125 INFO L225 Difference]: With dead ends: 1232 [2020-01-16 18:43:35,125 INFO L226 Difference]: Without dead ends: 1216 [2020-01-16 18:43:35,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-01-16 18:43:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 783. [2020-01-16 18:43:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:43:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3100 transitions. [2020-01-16 18:43:35,145 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3100 transitions. Word has length 25 [2020-01-16 18:43:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:35,146 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3100 transitions. [2020-01-16 18:43:35,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3100 transitions. [2020-01-16 18:43:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:35,147 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:35,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:35,147 INFO L426 AbstractCegarLoop]: === Iteration 1405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash -391254781, now seen corresponding path program 1398 times [2020-01-16 18:43:35,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:35,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602659863] [2020-01-16 18:43:35,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:35,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602659863] [2020-01-16 18:43:35,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:35,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:35,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423773061] [2020-01-16 18:43:35,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:35,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:35,499 INFO L87 Difference]: Start difference. First operand 783 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:43:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:35,637 INFO L93 Difference]: Finished difference Result 1230 states and 4301 transitions. [2020-01-16 18:43:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:35,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:35,641 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:43:35,641 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:43:35,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:43:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 773. [2020-01-16 18:43:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:43:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:43:35,661 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:43:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:35,661 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:43:35,661 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:43:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:35,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:35,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:35,662 INFO L426 AbstractCegarLoop]: === Iteration 1406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash -865663233, now seen corresponding path program 1399 times [2020-01-16 18:43:35,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:35,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772045025] [2020-01-16 18:43:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:36,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-01-16 18:43:36,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772045025] [2020-01-16 18:43:36,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:36,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:36,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395800343] [2020-01-16 18:43:36,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:36,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:36,005 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:43:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:43:36,175 INFO L93 Difference]: Finished difference Result 1221 states and 4285 transitions. [2020-01-16 18:43:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:43:36,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:43:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:43:36,178 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:43:36,178 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:43:36,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:43:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:43:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-01-16 18:43:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:43:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3098 transitions. [2020-01-16 18:43:36,198 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3098 transitions. Word has length 25 [2020-01-16 18:43:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:43:36,198 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3098 transitions. [2020-01-16 18:43:36,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:43:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3098 transitions. [2020-01-16 18:43:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:43:36,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:43:36,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:43:36,199 INFO L426 AbstractCegarLoop]: === Iteration 1407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:43:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:43:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1938748613, now seen corresponding path program 1400 times [2020-01-16 18:43:36,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:43:36,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007889991] [2020-01-16 18:43:36,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:43:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:43:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:43:36,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007889991] [2020-01-16 18:43:36,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:43:36,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:43:36,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632883957] [2020-01-16 18:43:36,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:43:36,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:43:36,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:43:36,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:43:36,565 INFO L87 Difference]: Start difference. First operand 781 states and 3098 transitions. Second operand 10 states. Received shutdown request... [2020-01-16 18:43:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:43:36,633 WARN L543 AbstractCegarLoop]: Verification canceled [2020-01-16 18:43:36,637 WARN L227 ceAbstractionStarter]: Timeout [2020-01-16 18:43:36,638 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 06:43:36 BasicIcfg [2020-01-16 18:43:36,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 18:43:36,639 INFO L168 Benchmark]: Toolchain (without parser) took 768135.68 ms. Allocated memory was 144.7 MB in the beginning and 883.9 MB in the end (delta: 739.2 MB). Free memory was 118.5 MB in the beginning and 774.2 MB in the end (delta: -655.7 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,639 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.71 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 144.7 MB. Free memory was 118.3 MB in the beginning and 116.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,640 INFO L168 Benchmark]: Boogie Preprocessor took 23.54 ms. Allocated memory is still 144.7 MB. Free memory was 116.7 MB in the beginning and 115.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,640 INFO L168 Benchmark]: RCFGBuilder took 350.68 ms. Allocated memory is still 144.7 MB. Free memory was 115.5 MB in the beginning and 102.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,640 INFO L168 Benchmark]: TraceAbstraction took 767714.74 ms. Allocated memory was 144.7 MB in the beginning and 883.9 MB in the end (delta: 739.2 MB). Free memory was 102.0 MB in the beginning and 774.2 MB in the end (delta: -672.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2020-01-16 18:43:36,641 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.71 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 144.7 MB. Free memory was 118.3 MB in the beginning and 116.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.54 ms. Allocated memory is still 144.7 MB. Free memory was 116.7 MB in the beginning and 115.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 350.68 ms. Allocated memory is still 144.7 MB. Free memory was 115.5 MB in the beginning and 102.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 767714.74 ms. Allocated memory was 144.7 MB in the beginning and 883.9 MB in the end (delta: 739.2 MB). Free memory was 102.0 MB in the beginning and 774.2 MB in the end (delta: -672.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 68 ProgramPointsBefore, 58 ProgramPointsAfterwards, 99 TransitionsBefore, 90 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 504 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 532 CheckedPairsTotal, 9 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (781states) and FLOYD_HOARE automaton (currently 9 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (805 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 767.4s, OverallIterations: 1407, TraceHistogramMax: 1, AutomataDifference: 205.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 125342 SDtfs, 185819 SDslu, 320576 SDs, 0 SdLazy, 95771 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14020 GetRequests, 1414 SyntacticMatches, 0 SemanticMatches, 12606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8400 ImplicationChecksByTransitivity, 582.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6818occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.6s AutomataMinimizationTime, 1406 MinimizatonAttempts, 727421 StatesRemovedByMinimization, 1399 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 515.9s InterpolantComputationTime, 35175 NumberOfCodeBlocks, 35175 NumberOfCodeBlocksAsserted, 1407 NumberOfCheckSat, 33768 ConstructedInterpolants, 0 QuantifiedInterpolants, 23459184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1407 InterpolantComputations, 1407 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